/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/mix016.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:46:37,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:46:37,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:46:37,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:46:37,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:46:37,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:46:37,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:46:37,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:46:37,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:46:37,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:46:37,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:46:37,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:46:37,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:46:37,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:46:37,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:46:37,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:46:37,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:46:37,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:46:37,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:46:37,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:46:37,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:46:37,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:46:37,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:46:37,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:46:37,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:46:37,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:46:37,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:46:37,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:46:37,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:46:37,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:46:37,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:46:37,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:46:37,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:46:37,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:46:37,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:46:37,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:46:37,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:46:37,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:46:37,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:46:37,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:46:37,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:46:37,195 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:46:37,224 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:46:37,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:46:37,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:46:37,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:46:37,226 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:46:37,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:46:37,227 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:46:37,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:46:37,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:46:37,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:46:37,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:46:37,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:46:37,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:46:37,228 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:46:37,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:46:37,228 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:46:37,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:46:37,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:46:37,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:46:37,229 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:46:37,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:46:37,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:46:37,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:46:37,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:46:37,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:46:37,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:46:37,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:46:37,230 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:46:37,230 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:46:37,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:46:37,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:46:37,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:46:37,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:46:37,525 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:46:37,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016.oepc.i [2022-12-13 11:46:38,541 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:46:38,771 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:46:38,772 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016.oepc.i [2022-12-13 11:46:38,788 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a94a875/a83dafd6fb474a998295f3667f6fcbba/FLAG2f027a88c [2022-12-13 11:46:38,799 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a94a875/a83dafd6fb474a998295f3667f6fcbba [2022-12-13 11:46:38,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:46:38,804 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:46:38,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:46:38,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:46:38,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:46:38,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:46:38" (1/1) ... [2022-12-13 11:46:38,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a98ac01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:38, skipping insertion in model container [2022-12-13 11:46:38,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:46:38" (1/1) ... [2022-12-13 11:46:38,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:46:38,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:46:38,966 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/mix016.oepc.i[945,958] [2022-12-13 11:46:39,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:46:39,116 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:46:39,125 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/mix016.oepc.i[945,958] [2022-12-13 11:46:39,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:39,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:39,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:46:39,213 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:46:39,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:39 WrapperNode [2022-12-13 11:46:39,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:46:39,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:46:39,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:46:39,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:46:39,220 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:46:39" (1/1) ... [2022-12-13 11:46:39,242 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:46:39" (1/1) ... [2022-12-13 11:46:39,266 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-13 11:46:39,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:46:39,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:46:39,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:46:39,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:46:39,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:39" (1/1) ... [2022-12-13 11:46:39,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:39" (1/1) ... [2022-12-13 11:46:39,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:39" (1/1) ... [2022-12-13 11:46:39,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:39" (1/1) ... [2022-12-13 11:46:39,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:39" (1/1) ... [2022-12-13 11:46:39,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:39" (1/1) ... [2022-12-13 11:46:39,305 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:39" (1/1) ... [2022-12-13 11:46:39,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:39" (1/1) ... [2022-12-13 11:46:39,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:46:39,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:46:39,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:46:39,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:46:39,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:39" (1/1) ... [2022-12-13 11:46:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:46:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:46:39,337 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:46:39,341 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:46:39,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:46:39,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:46:39,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:46:39,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:46:39,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:46:39,383 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:46:39,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:46:39,383 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:46:39,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:46:39,384 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:46:39,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:46:39,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:46:39,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:46:39,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:46:39,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:46:39,385 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:46:39,487 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:46:39,488 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:46:39,775 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:46:39,856 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:46:39,857 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:46:39,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:46:39 BoogieIcfgContainer [2022-12-13 11:46:39,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:46:39,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:46:39,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:46:39,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:46:39,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:46:38" (1/3) ... [2022-12-13 11:46:39,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f82d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:46:39, skipping insertion in model container [2022-12-13 11:46:39,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:39" (2/3) ... [2022-12-13 11:46:39,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f82d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:46:39, skipping insertion in model container [2022-12-13 11:46:39,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:46:39" (3/3) ... [2022-12-13 11:46:39,864 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016.oepc.i [2022-12-13 11:46:39,877 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:46:39,877 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:46:39,877 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:46:39,935 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:46:39,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-13 11:46:40,018 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-13 11:46:40,018 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:40,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 11:46:40,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-13 11:46:40,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-13 11:46:40,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:40,043 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-13 11:46:40,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2022-12-13 11:46:40,071 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-13 11:46:40,072 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:40,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 11:46:40,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-13 11:46:40,074 INFO L226 LiptonReduction]: Number of co-enabled transitions 2008 [2022-12-13 11:46:44,296 INFO L241 LiptonReduction]: Total number of compositions: 86 [2022-12-13 11:46:44,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:46:44,313 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;@66199b12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:46:44,313 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:46:44,315 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-13 11:46:44,315 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:44,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:44,316 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 11:46:44,316 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:46:44,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash 488053, now seen corresponding path program 1 times [2022-12-13 11:46:44,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:44,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720705162] [2022-12-13 11:46:44,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:44,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:44,557 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:46:44,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:44,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720705162] [2022-12-13 11:46:44,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720705162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:44,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:44,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:46:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355792599] [2022-12-13 11:46:44,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:44,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:44,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:44,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:44,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:44,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 66 [2022-12-13 11:46:44,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:46:44,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:44,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 66 [2022-12-13 11:46:44,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:45,722 INFO L130 PetriNetUnfolder]: 9240/14286 cut-off events. [2022-12-13 11:46:45,722 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 11:46:45,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27524 conditions, 14286 events. 9240/14286 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 98123 event pairs, 4424 based on Foata normal form. 0/8794 useless extension candidates. Maximal degree in co-relation 27513. Up to 11165 conditions per place. [2022-12-13 11:46:45,762 INFO L137 encePairwiseOnDemand]: 62/66 looper letters, 36 selfloop transitions, 2 changer transitions 59/109 dead transitions. [2022-12-13 11:46:45,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 425 flow [2022-12-13 11:46:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:45,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-12-13 11:46:45,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2022-12-13 11:46:45,774 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 141 flow. Second operand 3 states and 138 transitions. [2022-12-13 11:46:45,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 425 flow [2022-12-13 11:46:45,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 109 transitions, 420 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:46:45,780 INFO L231 Difference]: Finished difference. Result has 73 places, 34 transitions, 78 flow [2022-12-13 11:46:45,781 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=73, PETRI_TRANSITIONS=34} [2022-12-13 11:46:45,785 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -3 predicate places. [2022-12-13 11:46:45,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:45,785 INFO L89 Accepts]: Start accepts. Operand has 73 places, 34 transitions, 78 flow [2022-12-13 11:46:45,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:45,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:45,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 34 transitions, 78 flow [2022-12-13 11:46:45,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2022-12-13 11:46:45,799 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-12-13 11:46:45,799 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:45,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 85 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:46:45,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 78 flow [2022-12-13 11:46:45,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 654 [2022-12-13 11:46:45,917 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:45,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 11:46:45,919 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 78 flow [2022-12-13 11:46:45,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:46:45,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:45,919 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:45,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:46:45,920 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:46:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1135460056, now seen corresponding path program 1 times [2022-12-13 11:46:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:45,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252059989] [2022-12-13 11:46:45,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:46,087 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:46:46,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:46,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252059989] [2022-12-13 11:46:46,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252059989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:46,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:46,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:46:46,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540884933] [2022-12-13 11:46:46,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:46,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:46,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:46,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:46,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:46,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2022-12-13 11:46:46,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 78 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:46:46,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:46,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2022-12-13 11:46:46,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:46,437 INFO L130 PetriNetUnfolder]: 1934/2955 cut-off events. [2022-12-13 11:46:46,438 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2022-12-13 11:46:46,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6018 conditions, 2955 events. 1934/2955 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14984 event pairs, 559 based on Foata normal form. 0/2349 useless extension candidates. Maximal degree in co-relation 6008. Up to 2101 conditions per place. [2022-12-13 11:46:46,460 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 31 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2022-12-13 11:46:46,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 172 flow [2022-12-13 11:46:46,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 11:46:46,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2022-12-13 11:46:46,462 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 78 flow. Second operand 3 states and 66 transitions. [2022-12-13 11:46:46,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 172 flow [2022-12-13 11:46:46,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:46,464 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 80 flow [2022-12-13 11:46:46,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-13 11:46:46,465 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -32 predicate places. [2022-12-13 11:46:46,465 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:46,465 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 80 flow [2022-12-13 11:46:46,466 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:46,466 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:46,466 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 80 flow [2022-12-13 11:46:46,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 80 flow [2022-12-13 11:46:46,472 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 11:46:46,473 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:46,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 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 87 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:46:46,474 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 80 flow [2022-12-13 11:46:46,474 INFO L226 LiptonReduction]: Number of co-enabled transitions 604 [2022-12-13 11:46:46,547 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:46:46,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 11:46:46,549 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 78 flow [2022-12-13 11:46:46,549 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:46:46,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:46,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:46,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:46:46,549 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:46:46,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:46,550 INFO L85 PathProgramCache]: Analyzing trace with hash 839955734, now seen corresponding path program 1 times [2022-12-13 11:46:46,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:46,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645291341] [2022-12-13 11:46:46,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:46,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:46,661 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:46:46,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:46,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645291341] [2022-12-13 11:46:46,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645291341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:46,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:46,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:46:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752433978] [2022-12-13 11:46:46,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:46,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:46,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:46,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:46,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:46,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 11:46:46,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:46:46,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:46,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 11:46:46,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:46,893 INFO L130 PetriNetUnfolder]: 1844/2832 cut-off events. [2022-12-13 11:46:46,893 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-12-13 11:46:46,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6094 conditions, 2832 events. 1844/2832 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14395 event pairs, 518 based on Foata normal form. 36/2062 useless extension candidates. Maximal degree in co-relation 6083. Up to 2674 conditions per place. [2022-12-13 11:46:46,904 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 35 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2022-12-13 11:46:46,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 215 flow [2022-12-13 11:46:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 11:46:46,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2022-12-13 11:46:46,906 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 78 flow. Second operand 3 states and 67 transitions. [2022-12-13 11:46:46,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 215 flow [2022-12-13 11:46:46,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:46,907 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 142 flow [2022-12-13 11:46:46,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2022-12-13 11:46:46,908 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -33 predicate places. [2022-12-13 11:46:46,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:46,908 INFO L89 Accepts]: Start accepts. Operand has 43 places, 41 transitions, 142 flow [2022-12-13 11:46:46,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:46,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:46,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 142 flow [2022-12-13 11:46:46,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 142 flow [2022-12-13 11:46:46,929 INFO L130 PetriNetUnfolder]: 216/488 cut-off events. [2022-12-13 11:46:46,929 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:46,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 488 events. 216/488 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3076 event pairs, 108 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 905. Up to 343 conditions per place. [2022-12-13 11:46:46,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 142 flow [2022-12-13 11:46:46,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-13 11:46:46,934 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:46,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 11:46:46,935 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 142 flow [2022-12-13 11:46:46,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:46:46,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:46,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:46,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:46:46,935 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:46:46,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1256890247, now seen corresponding path program 1 times [2022-12-13 11:46:46,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:46,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705698455] [2022-12-13 11:46:46,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:46,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:47,058 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:46:47,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:47,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705698455] [2022-12-13 11:46:47,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705698455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:47,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:47,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:47,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646616340] [2022-12-13 11:46:47,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:47,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:47,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:47,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:47,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:47,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 11:46:47,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 142 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:46:47,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:47,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 11:46:47,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:47,246 INFO L130 PetriNetUnfolder]: 938/1647 cut-off events. [2022-12-13 11:46:47,246 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-13 11:46:47,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4457 conditions, 1647 events. 938/1647 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8968 event pairs, 149 based on Foata normal form. 99/1288 useless extension candidates. Maximal degree in co-relation 4445. Up to 1144 conditions per place. [2022-12-13 11:46:47,262 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 44 selfloop transitions, 19 changer transitions 0/70 dead transitions. [2022-12-13 11:46:47,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 352 flow [2022-12-13 11:46:47,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:46:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:46:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 11:46:47,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71875 [2022-12-13 11:46:47,264 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 142 flow. Second operand 4 states and 92 transitions. [2022-12-13 11:46:47,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 352 flow [2022-12-13 11:46:47,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:46:47,266 INFO L231 Difference]: Finished difference. Result has 46 places, 50 transitions, 244 flow [2022-12-13 11:46:47,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2022-12-13 11:46:47,266 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -30 predicate places. [2022-12-13 11:46:47,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:47,267 INFO L89 Accepts]: Start accepts. Operand has 46 places, 50 transitions, 244 flow [2022-12-13 11:46:47,267 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:47,267 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:47,267 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 50 transitions, 244 flow [2022-12-13 11:46:47,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 50 transitions, 244 flow [2022-12-13 11:46:47,288 INFO L130 PetriNetUnfolder]: 162/407 cut-off events. [2022-12-13 11:46:47,289 INFO L131 PetriNetUnfolder]: For 18/63 co-relation queries the response was YES. [2022-12-13 11:46:47,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 407 events. 162/407 cut-off events. For 18/63 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2442 event pairs, 27 based on Foata normal form. 2/248 useless extension candidates. Maximal degree in co-relation 1076. Up to 280 conditions per place. [2022-12-13 11:46:47,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 50 transitions, 244 flow [2022-12-13 11:46:47,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-13 11:46:47,294 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:47,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 11:46:47,295 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 244 flow [2022-12-13 11:46:47,295 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:46:47,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:47,295 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:46:47,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:46:47,295 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:46:47,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash 911370597, now seen corresponding path program 1 times [2022-12-13 11:46:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:47,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228441946] [2022-12-13 11:46:47,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:47,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:47,734 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:46:47,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:47,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228441946] [2022-12-13 11:46:47,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228441946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:47,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:47,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:46:47,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792015957] [2022-12-13 11:46:47,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:47,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:46:47,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:47,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:46:47,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:46:47,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 11:46:47,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:46:47,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:47,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 11:46:47,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:48,038 INFO L130 PetriNetUnfolder]: 1223/2246 cut-off events. [2022-12-13 11:46:48,038 INFO L131 PetriNetUnfolder]: For 1001/1161 co-relation queries the response was YES. [2022-12-13 11:46:48,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7267 conditions, 2246 events. 1223/2246 cut-off events. For 1001/1161 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13994 event pairs, 164 based on Foata normal form. 170/2029 useless extension candidates. Maximal degree in co-relation 7253. Up to 1244 conditions per place. [2022-12-13 11:46:48,049 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 63 selfloop transitions, 8 changer transitions 37/124 dead transitions. [2022-12-13 11:46:48,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 124 transitions, 807 flow [2022-12-13 11:46:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:46:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:46:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2022-12-13 11:46:48,051 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 11:46:48,051 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 244 flow. Second operand 7 states and 147 transitions. [2022-12-13 11:46:48,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 124 transitions, 807 flow [2022-12-13 11:46:48,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 711 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:48,056 INFO L231 Difference]: Finished difference. Result has 55 places, 57 transitions, 262 flow [2022-12-13 11:46:48,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=55, PETRI_TRANSITIONS=57} [2022-12-13 11:46:48,058 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -21 predicate places. [2022-12-13 11:46:48,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:48,058 INFO L89 Accepts]: Start accepts. Operand has 55 places, 57 transitions, 262 flow [2022-12-13 11:46:48,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:48,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:48,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 57 transitions, 262 flow [2022-12-13 11:46:48,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 57 transitions, 262 flow [2022-12-13 11:46:48,116 INFO L130 PetriNetUnfolder]: 230/599 cut-off events. [2022-12-13 11:46:48,116 INFO L131 PetriNetUnfolder]: For 241/259 co-relation queries the response was YES. [2022-12-13 11:46:48,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1634 conditions, 599 events. 230/599 cut-off events. For 241/259 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 4344 event pairs, 37 based on Foata normal form. 5/375 useless extension candidates. Maximal degree in co-relation 1618. Up to 379 conditions per place. [2022-12-13 11:46:48,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 57 transitions, 262 flow [2022-12-13 11:46:48,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 836 [2022-12-13 11:46:48,274 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:46:48,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-13 11:46:48,275 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 266 flow [2022-12-13 11:46:48,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:46:48,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:48,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:48,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:46:48,276 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:46:48,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:48,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1229863434, now seen corresponding path program 1 times [2022-12-13 11:46:48,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:48,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385305618] [2022-12-13 11:46:48,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:48,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:48,436 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:46:48,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:48,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385305618] [2022-12-13 11:46:48,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385305618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:48,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:48,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:46:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729711168] [2022-12-13 11:46:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:48,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:46:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:48,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:46:48,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:46:48,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 11:46:48,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 266 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:46:48,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:48,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 11:46:48,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:48,577 INFO L130 PetriNetUnfolder]: 587/1087 cut-off events. [2022-12-13 11:46:48,577 INFO L131 PetriNetUnfolder]: For 680/680 co-relation queries the response was YES. [2022-12-13 11:46:48,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3519 conditions, 1087 events. 587/1087 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5658 event pairs, 56 based on Foata normal form. 126/877 useless extension candidates. Maximal degree in co-relation 3500. Up to 399 conditions per place. [2022-12-13 11:46:48,583 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 45 selfloop transitions, 28 changer transitions 0/80 dead transitions. [2022-12-13 11:46:48,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 492 flow [2022-12-13 11:46:48,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:46:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:46:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-13 11:46:48,584 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-13 11:46:48,584 INFO L175 Difference]: Start difference. First operand has 53 places, 57 transitions, 266 flow. Second operand 5 states and 100 transitions. [2022-12-13 11:46:48,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 492 flow [2022-12-13 11:46:48,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 480 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 11:46:48,587 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 323 flow [2022-12-13 11:46:48,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2022-12-13 11:46:48,587 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -21 predicate places. [2022-12-13 11:46:48,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:48,587 INFO L89 Accepts]: Start accepts. Operand has 55 places, 56 transitions, 323 flow [2022-12-13 11:46:48,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:48,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:48,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 56 transitions, 323 flow [2022-12-13 11:46:48,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 56 transitions, 323 flow [2022-12-13 11:46:48,605 INFO L130 PetriNetUnfolder]: 122/356 cut-off events. [2022-12-13 11:46:48,605 INFO L131 PetriNetUnfolder]: For 141/195 co-relation queries the response was YES. [2022-12-13 11:46:48,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 356 events. 122/356 cut-off events. For 141/195 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2206 event pairs, 1 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 1134. Up to 235 conditions per place. [2022-12-13 11:46:48,608 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 56 transitions, 323 flow [2022-12-13 11:46:48,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-13 11:46:49,083 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:46:49,084 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 497 [2022-12-13 11:46:49,084 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 319 flow [2022-12-13 11:46:49,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:46:49,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:49,084 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:46:49,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:46:49,084 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:46:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:49,085 INFO L85 PathProgramCache]: Analyzing trace with hash -762589134, now seen corresponding path program 1 times [2022-12-13 11:46:49,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:49,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615116765] [2022-12-13 11:46:49,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:49,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:49,845 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:46:49,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:49,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615116765] [2022-12-13 11:46:49,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615116765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:49,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:49,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:46:49,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551449185] [2022-12-13 11:46:49,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:49,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:46:49,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:49,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:46:49,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:46:49,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2022-12-13 11:46:49,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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:46:49,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:49,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2022-12-13 11:46:49,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:50,124 INFO L130 PetriNetUnfolder]: 846/1594 cut-off events. [2022-12-13 11:46:50,125 INFO L131 PetriNetUnfolder]: For 2142/2299 co-relation queries the response was YES. [2022-12-13 11:46:50,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6132 conditions, 1594 events. 846/1594 cut-off events. For 2142/2299 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9736 event pairs, 94 based on Foata normal form. 99/1341 useless extension candidates. Maximal degree in co-relation 6113. Up to 796 conditions per place. [2022-12-13 11:46:50,135 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 86 selfloop transitions, 8 changer transitions 27/137 dead transitions. [2022-12-13 11:46:50,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 137 transitions, 1077 flow [2022-12-13 11:46:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:46:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:46:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2022-12-13 11:46:50,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2022-12-13 11:46:50,137 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 319 flow. Second operand 6 states and 129 transitions. [2022-12-13 11:46:50,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 137 transitions, 1077 flow [2022-12-13 11:46:50,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 137 transitions, 883 flow, removed 42 selfloop flow, removed 3 redundant places. [2022-12-13 11:46:50,155 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 306 flow [2022-12-13 11:46:50,156 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2022-12-13 11:46:50,156 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2022-12-13 11:46:50,156 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:50,156 INFO L89 Accepts]: Start accepts. Operand has 58 places, 59 transitions, 306 flow [2022-12-13 11:46:50,157 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:50,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:50,157 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 59 transitions, 306 flow [2022-12-13 11:46:50,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 59 transitions, 306 flow [2022-12-13 11:46:50,190 INFO L130 PetriNetUnfolder]: 332/668 cut-off events. [2022-12-13 11:46:50,190 INFO L131 PetriNetUnfolder]: For 500/503 co-relation queries the response was YES. [2022-12-13 11:46:50,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 668 events. 332/668 cut-off events. For 500/503 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 3959 event pairs, 3 based on Foata normal form. 1/269 useless extension candidates. Maximal degree in co-relation 1848. Up to 307 conditions per place. [2022-12-13 11:46:50,195 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 59 transitions, 306 flow [2022-12-13 11:46:50,195 INFO L226 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-13 11:46:50,196 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:50,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 11:46:50,197 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 306 flow [2022-12-13 11:46:50,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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:46:50,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:50,197 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:46:50,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:46:50,198 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:46:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1758494696, now seen corresponding path program 2 times [2022-12-13 11:46:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:50,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115340976] [2022-12-13 11:46:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:50,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:50,339 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:46:50,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:50,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115340976] [2022-12-13 11:46:50,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115340976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:50,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:50,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605111711] [2022-12-13 11:46:50,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:50,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:50,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:50,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:50,341 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 11:46:50,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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:46:50,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:50,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 11:46:50,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:50,550 INFO L130 PetriNetUnfolder]: 1191/2203 cut-off events. [2022-12-13 11:46:50,550 INFO L131 PetriNetUnfolder]: For 3695/3833 co-relation queries the response was YES. [2022-12-13 11:46:50,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7800 conditions, 2203 events. 1191/2203 cut-off events. For 3695/3833 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 14423 event pairs, 195 based on Foata normal form. 160/1853 useless extension candidates. Maximal degree in co-relation 7778. Up to 896 conditions per place. [2022-12-13 11:46:50,562 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 56 selfloop transitions, 1 changer transitions 37/109 dead transitions. [2022-12-13 11:46:50,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 109 transitions, 794 flow [2022-12-13 11:46:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:46:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:46:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 11:46:50,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 11:46:50,563 INFO L175 Difference]: Start difference. First operand has 57 places, 59 transitions, 306 flow. Second operand 4 states and 78 transitions. [2022-12-13 11:46:50,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 109 transitions, 794 flow [2022-12-13 11:46:50,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 109 transitions, 763 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 11:46:50,633 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 297 flow [2022-12-13 11:46:50,633 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2022-12-13 11:46:50,634 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -17 predicate places. [2022-12-13 11:46:50,634 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:50,634 INFO L89 Accepts]: Start accepts. Operand has 59 places, 59 transitions, 297 flow [2022-12-13 11:46:50,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:50,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:50,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 59 transitions, 297 flow [2022-12-13 11:46:50,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 59 transitions, 297 flow [2022-12-13 11:46:50,669 INFO L130 PetriNetUnfolder]: 264/645 cut-off events. [2022-12-13 11:46:50,669 INFO L131 PetriNetUnfolder]: For 507/522 co-relation queries the response was YES. [2022-12-13 11:46:50,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 645 events. 264/645 cut-off events. For 507/522 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 4192 event pairs, 7 based on Foata normal form. 2/271 useless extension candidates. Maximal degree in co-relation 1840. Up to 325 conditions per place. [2022-12-13 11:46:50,674 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 59 transitions, 297 flow [2022-12-13 11:46:50,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-13 11:46:51,391 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:46:51,392 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 758 [2022-12-13 11:46:51,392 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 305 flow [2022-12-13 11:46:51,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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:46:51,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:51,392 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:46:51,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:46:51,392 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:46:51,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:51,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1705932766, now seen corresponding path program 1 times [2022-12-13 11:46:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:51,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326551481] [2022-12-13 11:46:51,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:51,641 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:46:51,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:51,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326551481] [2022-12-13 11:46:51,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326551481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:51,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:51,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:51,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757861503] [2022-12-13 11:46:51,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:51,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:51,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:51,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:51,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:51,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 11:46:51,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:46:51,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:51,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 11:46:51,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:51,862 INFO L130 PetriNetUnfolder]: 1070/1999 cut-off events. [2022-12-13 11:46:51,862 INFO L131 PetriNetUnfolder]: For 3167/3306 co-relation queries the response was YES. [2022-12-13 11:46:51,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7042 conditions, 1999 events. 1070/1999 cut-off events. For 3167/3306 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 13097 event pairs, 112 based on Foata normal form. 165/1699 useless extension candidates. Maximal degree in co-relation 7020. Up to 817 conditions per place. [2022-12-13 11:46:51,872 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 37 selfloop transitions, 1 changer transitions 58/110 dead transitions. [2022-12-13 11:46:51,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 110 transitions, 793 flow [2022-12-13 11:46:51,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:46:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:46:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 11:46:51,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2022-12-13 11:46:51,873 INFO L175 Difference]: Start difference. First operand has 57 places, 58 transitions, 305 flow. Second operand 4 states and 87 transitions. [2022-12-13 11:46:51,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 110 transitions, 793 flow [2022-12-13 11:46:51,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 110 transitions, 779 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 11:46:51,898 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 259 flow [2022-12-13 11:46:51,898 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2022-12-13 11:46:51,899 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -17 predicate places. [2022-12-13 11:46:51,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:51,899 INFO L89 Accepts]: Start accepts. Operand has 59 places, 50 transitions, 259 flow [2022-12-13 11:46:51,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:51,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:51,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 50 transitions, 259 flow [2022-12-13 11:46:51,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 259 flow [2022-12-13 11:46:51,918 INFO L130 PetriNetUnfolder]: 127/318 cut-off events. [2022-12-13 11:46:51,918 INFO L131 PetriNetUnfolder]: For 255/267 co-relation queries the response was YES. [2022-12-13 11:46:51,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 318 events. 127/318 cut-off events. For 255/267 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 1765 event pairs, 4 based on Foata normal form. 2/131 useless extension candidates. Maximal degree in co-relation 913. Up to 154 conditions per place. [2022-12-13 11:46:51,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 259 flow [2022-12-13 11:46:51,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-13 11:46:52,025 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:46:52,026 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 11:46:52,026 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 260 flow [2022-12-13 11:46:52,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:46:52,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:52,026 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:52,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:46:52,026 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:46:52,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash -119044558, now seen corresponding path program 1 times [2022-12-13 11:46:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:52,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183283688] [2022-12-13 11:46:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:52,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:52,385 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:46:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:52,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183283688] [2022-12-13 11:46:52,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183283688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:52,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:52,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:46:52,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864240506] [2022-12-13 11:46:52,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:52,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:46:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:52,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:46:52,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:46:52,387 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 11:46:52,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:46:52,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:52,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 11:46:52,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:52,544 INFO L130 PetriNetUnfolder]: 380/746 cut-off events. [2022-12-13 11:46:52,544 INFO L131 PetriNetUnfolder]: For 1239/1287 co-relation queries the response was YES. [2022-12-13 11:46:52,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 746 events. 380/746 cut-off events. For 1239/1287 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4028 event pairs, 31 based on Foata normal form. 56/613 useless extension candidates. Maximal degree in co-relation 2650. Up to 313 conditions per place. [2022-12-13 11:46:52,547 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 37 selfloop transitions, 4 changer transitions 42/95 dead transitions. [2022-12-13 11:46:52,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 671 flow [2022-12-13 11:46:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:46:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:46:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-12-13 11:46:52,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5123152709359606 [2022-12-13 11:46:52,548 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 260 flow. Second operand 7 states and 104 transitions. [2022-12-13 11:46:52,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 671 flow [2022-12-13 11:46:52,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 656 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 11:46:52,555 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 261 flow [2022-12-13 11:46:52,556 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2022-12-13 11:46:52,556 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -17 predicate places. [2022-12-13 11:46:52,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:52,557 INFO L89 Accepts]: Start accepts. Operand has 59 places, 47 transitions, 261 flow [2022-12-13 11:46:52,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:52,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:52,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 47 transitions, 261 flow [2022-12-13 11:46:52,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 261 flow [2022-12-13 11:46:52,574 INFO L130 PetriNetUnfolder]: 126/312 cut-off events. [2022-12-13 11:46:52,574 INFO L131 PetriNetUnfolder]: For 278/285 co-relation queries the response was YES. [2022-12-13 11:46:52,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 312 events. 126/312 cut-off events. For 278/285 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 1751 event pairs, 3 based on Foata normal form. 1/135 useless extension candidates. Maximal degree in co-relation 914. Up to 154 conditions per place. [2022-12-13 11:46:52,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 261 flow [2022-12-13 11:46:52,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-13 11:46:52,577 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:52,578 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 11:46:52,578 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 261 flow [2022-12-13 11:46:52,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:46:52,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:52,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:52,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:46:52,578 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:52,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:52,579 INFO L85 PathProgramCache]: Analyzing trace with hash 681491770, now seen corresponding path program 2 times [2022-12-13 11:46:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:52,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476980688] [2022-12-13 11:46:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:52,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:46:52,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:46:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:46:52,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:46:52,699 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:46:52,699 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:46:52,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:46:52,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:46:52,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:46:52,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:46:52,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:46:52,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:46:52,701 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:52,705 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:46:52,705 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:46:52,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:46:52 BasicIcfg [2022-12-13 11:46:52,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:46:52,770 INFO L158 Benchmark]: Toolchain (without parser) took 13966.04ms. Allocated memory was 189.8MB in the beginning and 782.2MB in the end (delta: 592.4MB). Free memory was 164.7MB in the beginning and 683.5MB in the end (delta: -518.8MB). Peak memory consumption was 526.9MB. Max. memory is 8.0GB. [2022-12-13 11:46:52,770 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:46:52,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.35ms. Allocated memory is still 189.8MB. Free memory was 164.4MB in the beginning and 137.9MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 11:46:52,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.81ms. Allocated memory is still 189.8MB. Free memory was 137.9MB in the beginning and 135.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:46:52,774 INFO L158 Benchmark]: Boogie Preprocessor took 41.03ms. Allocated memory is still 189.8MB. Free memory was 135.5MB in the beginning and 133.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:46:52,775 INFO L158 Benchmark]: RCFGBuilder took 547.47ms. Allocated memory is still 189.8MB. Free memory was 133.4MB in the beginning and 143.9MB in the end (delta: -10.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 11:46:52,775 INFO L158 Benchmark]: TraceAbstraction took 12909.73ms. Allocated memory was 189.8MB in the beginning and 782.2MB in the end (delta: 592.4MB). Free memory was 142.9MB in the beginning and 683.5MB in the end (delta: -540.6MB). Peak memory consumption was 505.4MB. Max. memory is 8.0GB. [2022-12-13 11:46:52,776 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.11ms. Allocated memory is still 189.8MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 408.35ms. Allocated memory is still 189.8MB. Free memory was 164.4MB in the beginning and 137.9MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.81ms. Allocated memory is still 189.8MB. Free memory was 137.9MB in the beginning and 135.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.03ms. Allocated memory is still 189.8MB. Free memory was 135.5MB in the beginning and 133.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 547.47ms. Allocated memory is still 189.8MB. Free memory was 133.4MB in the beginning and 143.9MB in the end (delta: -10.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12909.73ms. Allocated memory was 189.8MB in the beginning and 782.2MB in the end (delta: 592.4MB). Free memory was 142.9MB in the beginning and 683.5MB in the end (delta: -540.6MB). Peak memory consumption was 505.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 116 PlacesBefore, 76 PlacesAfterwards, 108 TransitionsBefore, 66 TransitionsAfterwards, 2008 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3475, independent: 3297, independent conditional: 3297, independent unconditional: 0, dependent: 178, dependent conditional: 178, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3475, independent: 3297, independent conditional: 0, independent unconditional: 3297, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3475, independent: 3297, independent conditional: 0, independent unconditional: 3297, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3475, independent: 3297, independent conditional: 0, independent unconditional: 3297, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1815, independent: 1746, independent conditional: 0, independent unconditional: 1746, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1815, independent: 1711, independent conditional: 0, independent unconditional: 1711, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 104, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 393, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 324, dependent conditional: 0, dependent unconditional: 324, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3475, independent: 1551, independent conditional: 0, independent unconditional: 1551, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 1815, unknown conditional: 0, unknown unconditional: 1815] , Statistics on independence cache: Total cache size (in pairs): 3104, Positive cache size: 3035, Positive conditional cache size: 0, Positive unconditional cache size: 3035, Negative cache size: 69, Negative conditional cache size: 0, Negative unconditional cache size: 69, 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, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 306, independent: 268, independent conditional: 268, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 306, independent: 268, independent conditional: 22, independent unconditional: 246, dependent: 38, dependent conditional: 14, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 306, independent: 268, independent conditional: 22, independent unconditional: 246, dependent: 38, dependent conditional: 14, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 306, independent: 268, independent conditional: 22, independent unconditional: 246, dependent: 38, dependent conditional: 14, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 256, independent: 229, independent conditional: 21, independent unconditional: 208, dependent: 27, dependent conditional: 8, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 256, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 27, dependent conditional: 8, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 78, dependent conditional: 43, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 306, independent: 39, independent conditional: 1, independent unconditional: 38, dependent: 11, dependent conditional: 6, dependent unconditional: 5, unknown: 256, unknown conditional: 29, unknown unconditional: 227] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 229, Positive conditional cache size: 21, Positive unconditional cache size: 208, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, 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, 42 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 467, independent: 402, independent conditional: 402, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 467, independent: 402, independent conditional: 33, independent unconditional: 369, dependent: 65, dependent conditional: 2, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 467, independent: 402, independent conditional: 0, independent unconditional: 402, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 467, independent: 402, independent conditional: 0, independent unconditional: 402, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 467, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 37, unknown conditional: 0, unknown unconditional: 37] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 268, Positive conditional cache size: 22, Positive unconditional cache size: 246, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, 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, 43 PlacesBefore, 43 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 696 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, independent: 119, independent conditional: 119, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 149, independent: 119, independent conditional: 6, independent unconditional: 113, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 149, independent: 119, independent conditional: 6, independent unconditional: 113, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 149, independent: 119, independent conditional: 6, independent unconditional: 113, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 149, independent: 118, independent conditional: 6, independent unconditional: 112, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 269, Positive conditional cache size: 22, Positive unconditional cache size: 247, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, 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.0s, 46 PlacesBefore, 46 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 714 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 167, independent conditional: 167, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 206, independent: 167, independent conditional: 30, independent unconditional: 137, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 206, independent: 167, independent conditional: 30, independent unconditional: 137, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 206, independent: 167, independent conditional: 30, independent unconditional: 137, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 8, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 206, independent: 157, independent conditional: 22, independent unconditional: 135, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 10, unknown conditional: 8, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 279, Positive conditional cache size: 30, Positive unconditional cache size: 249, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, 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.2s, 53 PlacesBefore, 53 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 836 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 251, independent: 209, independent conditional: 209, 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: 251, independent: 209, independent conditional: 57, independent unconditional: 152, 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: 251, independent: 209, independent conditional: 57, independent unconditional: 152, 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: 251, independent: 209, independent conditional: 57, independent unconditional: 152, 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: 15, independent: 15, independent conditional: 2, independent unconditional: 13, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 251, independent: 194, independent conditional: 55, independent unconditional: 139, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 15, unknown conditional: 2, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 298, Positive conditional cache size: 32, Positive unconditional cache size: 266, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, 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.5s, 55 PlacesBefore, 53 PlacesAfterwards, 56 TransitionsBefore, 54 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 546, independent: 502, independent conditional: 502, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 546, independent: 502, independent conditional: 280, independent unconditional: 222, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 546, independent: 502, independent conditional: 280, independent unconditional: 222, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 546, independent: 502, independent conditional: 280, independent unconditional: 222, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 22, independent unconditional: 10, 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: 32, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 546, independent: 470, independent conditional: 258, independent unconditional: 212, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 32, unknown conditional: 22, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 333, Positive conditional cache size: 54, Positive unconditional cache size: 279, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, 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.0s, 57 PlacesBefore, 57 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 137, independent: 121, independent conditional: 51, independent unconditional: 70, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 137, independent: 121, independent conditional: 51, independent unconditional: 70, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 137, independent: 121, independent conditional: 51, independent unconditional: 70, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 137, independent: 121, independent conditional: 51, independent unconditional: 70, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 333, Positive conditional cache size: 54, Positive unconditional cache size: 279, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, 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.7s, 58 PlacesBefore, 57 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 166, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 166, independent: 144, independent conditional: 57, independent unconditional: 87, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 166, independent: 144, independent conditional: 57, independent unconditional: 87, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 166, independent: 144, independent conditional: 57, independent unconditional: 87, dependent: 22, dependent conditional: 0, dependent unconditional: 22, 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: 166, independent: 142, independent conditional: 57, independent unconditional: 85, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 367, Positive conditional cache size: 54, Positive unconditional cache size: 313, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, 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, 56 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 30, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 42, independent conditional: 30, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 30, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 42, independent: 36, independent conditional: 29, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 406, Positive conditional cache size: 57, Positive unconditional cache size: 349, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, 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.0s, 54 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 406, Positive conditional cache size: 57, Positive unconditional cache size: 349, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L840] 0 pthread_t t409; [L841] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t409, ((void *)0), P0, ((void *)0))=-3, t409={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] [L842] 0 pthread_t t410; [L843] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t410, ((void *)0), P1, ((void *)0))=-2, t409={5:0}, t410={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] [L844] 0 pthread_t t411; [L845] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t411, ((void *)0), P2, ((void *)0))=-1, t409={5:0}, t410={6:0}, t411={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] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L776] 2 x = 1 [L779] 2 __unbuffered_p1_EAX = y [L782] 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) [L783] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] 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 [L785] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L796] 3 y = 1 [L799] 3 __unbuffered_p2_EAX = y [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 z$flush_delayed = weak$$choice2 [L805] 3 z$mem_tmp = z [L806] 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) [L807] 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)) [L808] 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)) [L809] 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)) [L810] 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)) [L811] 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)) [L812] 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)) [L813] 3 __unbuffered_p2_EBX = z [L814] 3 z = z$flush_delayed ? z$mem_tmp : z [L815] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 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) [L819] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L820] 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 [L821] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L822] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 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) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 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 [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 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 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, 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] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, 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] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 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) [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 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 [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 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 [L858] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, 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: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 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: 12.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 307 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1129 IncrementalHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 3 mSDtfsCounter, 1129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=6, InterpolantAutomatonStates: 46, 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.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 706 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:46:52,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...