/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/safe001_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:34:37,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:34:37,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:34:37,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:34:37,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:34:37,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:34:37,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:34:37,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:34:37,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:34:37,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:34:37,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:34:37,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:34:37,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:34:37,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:34:37,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:34:37,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:34:37,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:34:37,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:34:37,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:34:37,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:34:37,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:34:37,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:34:37,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:34:37,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:34:37,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:34:37,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:34:37,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:34:37,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:34:37,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:34:37,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:34:37,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:34:37,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:34:37,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:34:37,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:34:37,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:34:37,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:34:37,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:34:37,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:34:37,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:34:37,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:34:37,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:34:37,120 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-06 06:34:37,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:34:37,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:34:37,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:34:37,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:34:37,184 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:34:37,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:34:37,185 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:34:37,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:34:37,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:34:37,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:34:37,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:34:37,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:34:37,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:34:37,186 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:34:37,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:34:37,186 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:34:37,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:34:37,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:34:37,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:34:37,187 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:34:37,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:34:37,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:34:37,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:34:37,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:34:37,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:34:37,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:34:37,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:34:37,188 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:34:37,188 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-06 06:34:37,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:34:37,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:34:37,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:34:37,616 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:34:37,617 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:34:37,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2022-12-06 06:34:38,860 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:34:39,147 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:34:39,148 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2022-12-06 06:34:39,161 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74aa5b5a4/faf429320ccb4a0995686a91bb27d56b/FLAG69eb0f5d0 [2022-12-06 06:34:39,174 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74aa5b5a4/faf429320ccb4a0995686a91bb27d56b [2022-12-06 06:34:39,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:34:39,178 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:34:39,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:34:39,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:34:39,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:34:39,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bfeaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39, skipping insertion in model container [2022-12-06 06:34:39,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:34:39,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:34:39,377 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/safe001_rmo.oepc.i[993,1006] [2022-12-06 06:34:39,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:34:39,610 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:34:39,621 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/safe001_rmo.oepc.i[993,1006] [2022-12-06 06:34:39,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:39,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:39,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:34:39,698 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:34:39,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39 WrapperNode [2022-12-06 06:34:39,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:34:39,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:34:39,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:34:39,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:34:39,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,754 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2022-12-06 06:34:39,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:34:39,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:34:39,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:34:39,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:34:39,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,783 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:34:39,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:34:39,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:34:39,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:34:39,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (1/1) ... [2022-12-06 06:34:39,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:34:39,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:34:39,858 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-06 06:34:39,868 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-06 06:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:34:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:34:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:34:39,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:34:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:34:39,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:34:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:34:39,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:34:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:34:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:34:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:34:39,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:34:39,903 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:34:40,120 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:34:40,122 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:34:40,616 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:34:40,942 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:34:40,942 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:34:40,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:34:40 BoogieIcfgContainer [2022-12-06 06:34:40,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:34:40,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:34:40,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:34:40,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:34:40,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:34:39" (1/3) ... [2022-12-06 06:34:40,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f9ddc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:34:40, skipping insertion in model container [2022-12-06 06:34:40,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:39" (2/3) ... [2022-12-06 06:34:40,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f9ddc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:34:40, skipping insertion in model container [2022-12-06 06:34:40,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:34:40" (3/3) ... [2022-12-06 06:34:40,954 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_rmo.oepc.i [2022-12-06 06:34:40,971 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:34:40,971 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:34:40,971 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:34:41,038 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:34:41,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 06:34:41,144 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 06:34:41,144 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:41,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 06:34:41,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 06:34:41,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-06 06:34:41,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:41,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 06:34:41,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-06 06:34:41,230 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-06 06:34:41,230 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:41,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-06 06:34:41,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 06:34:41,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-06 06:34:51,995 INFO L203 LiptonReduction]: Total number of compositions: 90 [2022-12-06 06:34:52,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:34:52,023 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;@595c9242, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:34:52,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 06:34:52,029 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 06:34:52,029 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:52,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:52,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:52,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash 775914467, now seen corresponding path program 1 times [2022-12-06 06:34:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:52,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981481669] [2022-12-06 06:34:52,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:52,271 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-06 06:34:52,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:52,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981481669] [2022-12-06 06:34:52,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981481669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:52,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:52,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:34:52,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939212520] [2022-12-06 06:34:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:52,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:34:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:52,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:34:52,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:34:52,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 06:34:52,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 51 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-06 06:34:52,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:52,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 06:34:52,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:52,487 INFO L130 PetriNetUnfolder]: 407/644 cut-off events. [2022-12-06 06:34:52,488 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 06:34:52,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 644 events. 407/644 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2722 event pairs, 407 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 1300. Up to 631 conditions per place. [2022-12-06 06:34:52,495 INFO L137 encePairwiseOnDemand]: 20/21 looper letters, 17 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-06 06:34:52,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 83 flow [2022-12-06 06:34:52,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:34:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:34:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 24 transitions. [2022-12-06 06:34:52,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 06:34:52,508 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 51 flow. Second operand 2 states and 24 transitions. [2022-12-06 06:34:52,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 83 flow [2022-12-06 06:34:52,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:34:52,512 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 46 flow [2022-12-06 06:34:52,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-06 06:34:52,517 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-06 06:34:52,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:52,518 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 46 flow [2022-12-06 06:34:52,520 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:52,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:52,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 46 flow [2022-12-06 06:34:52,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 46 flow [2022-12-06 06:34:52,528 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:34:52,528 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:52,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 06:34:52,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 46 flow [2022-12-06 06:34:52,529 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:34:52,721 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:52,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 06:34:52,723 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 46 flow [2022-12-06 06:34:52,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-06 06:34:52,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:52,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:52,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:34:52,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:52,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1670511227, now seen corresponding path program 1 times [2022-12-06 06:34:52,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:52,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610611662] [2022-12-06 06:34:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:53,015 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-06 06:34:53,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:53,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610611662] [2022-12-06 06:34:53,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610611662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:53,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:53,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:34:53,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255058957] [2022-12-06 06:34:53,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:53,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:34:53,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:34:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:34:53,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:34:53,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-06 06:34:53,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:53,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:34:53,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:53,239 INFO L130 PetriNetUnfolder]: 545/892 cut-off events. [2022-12-06 06:34:53,239 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:53,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 892 events. 545/892 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4132 event pairs, 125 based on Foata normal form. 8/897 useless extension candidates. Maximal degree in co-relation 1762. Up to 775 conditions per place. [2022-12-06 06:34:53,249 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-06 06:34:53,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 134 flow [2022-12-06 06:34:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 06:34:53,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 06:34:53,251 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states and 37 transitions. [2022-12-06 06:34:53,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 134 flow [2022-12-06 06:34:53,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:34:53,253 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2022-12-06 06:34:53,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-06 06:34:53,255 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-12-06 06:34:53,255 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:53,255 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 06:34:53,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:53,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:53,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 06:34:53,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 06:34:53,266 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 06:34:53,266 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:53,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2022-12-06 06:34:53,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 06:34:53,267 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 06:34:53,323 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:53,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 06:34:53,326 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2022-12-06 06:34:53,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-06 06:34:53,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:53,327 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:53,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:34:53,327 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:53,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash -246239694, now seen corresponding path program 1 times [2022-12-06 06:34:53,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:53,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045730084] [2022-12-06 06:34:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:53,723 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-06 06:34:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:53,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045730084] [2022-12-06 06:34:53,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045730084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:53,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:53,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:34:53,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187494741] [2022-12-06 06:34:53,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:53,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:34:53,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:53,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:34:53,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:34:53,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-06 06:34:53,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 06:34:53,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:53,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-06 06:34:53,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:53,923 INFO L130 PetriNetUnfolder]: 474/765 cut-off events. [2022-12-06 06:34:53,923 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-06 06:34:53,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 765 events. 474/765 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3314 event pairs, 209 based on Foata normal form. 12/772 useless extension candidates. Maximal degree in co-relation 1688. Up to 581 conditions per place. [2022-12-06 06:34:53,931 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-06 06:34:53,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 156 flow [2022-12-06 06:34:53,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 06:34:53,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 06:34:53,933 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states and 39 transitions. [2022-12-06 06:34:53,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 156 flow [2022-12-06 06:34:53,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:34:53,935 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 70 flow [2022-12-06 06:34:53,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-06 06:34:53,937 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-12-06 06:34:53,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:53,937 INFO L89 Accepts]: Start accepts. Operand has 32 places, 22 transitions, 70 flow [2022-12-06 06:34:53,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:53,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:53,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 70 flow [2022-12-06 06:34:53,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 70 flow [2022-12-06 06:34:53,948 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 06:34:53,948 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:34:53,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2022-12-06 06:34:53,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 70 flow [2022-12-06 06:34:53,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 06:34:53,952 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:53,954 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 06:34:53,954 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 70 flow [2022-12-06 06:34:53,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 06:34:53,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:53,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:53,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:34:53,954 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash 956462151, now seen corresponding path program 1 times [2022-12-06 06:34:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:53,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189288636] [2022-12-06 06:34:53,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:53,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:54,078 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-06 06:34:54,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:54,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189288636] [2022-12-06 06:34:54,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189288636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:54,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:54,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:34:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115535357] [2022-12-06 06:34:54,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:54,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:34:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:54,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:34:54,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:34:54,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:34:54,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 06:34:54,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:54,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:34:54,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:54,325 INFO L130 PetriNetUnfolder]: 648/1039 cut-off events. [2022-12-06 06:34:54,325 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2022-12-06 06:34:54,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1039 events. 648/1039 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5084 event pairs, 348 based on Foata normal form. 32/1053 useless extension candidates. Maximal degree in co-relation 2426. Up to 640 conditions per place. [2022-12-06 06:34:54,333 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 29 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 06:34:54,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 162 flow [2022-12-06 06:34:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 06:34:54,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-06 06:34:54,336 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 70 flow. Second operand 3 states and 38 transitions. [2022-12-06 06:34:54,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 162 flow [2022-12-06 06:34:54,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:34:54,339 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 77 flow [2022-12-06 06:34:54,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 06:34:54,343 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 06:34:54,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:54,343 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 77 flow [2022-12-06 06:34:54,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:54,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:54,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 77 flow [2022-12-06 06:34:54,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 77 flow [2022-12-06 06:34:54,354 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 06:34:54,354 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-12-06 06:34:54,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 29 events. 0/29 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-06 06:34:54,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 77 flow [2022-12-06 06:34:54,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 06:34:54,358 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:54,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:34:54,365 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 77 flow [2022-12-06 06:34:54,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 06:34:54,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:54,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:54,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:34:54,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:54,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1912191750, now seen corresponding path program 1 times [2022-12-06 06:34:54,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:54,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992163184] [2022-12-06 06:34:54,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:54,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:54,597 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-06 06:34:54,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:54,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992163184] [2022-12-06 06:34:54,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992163184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:54,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:54,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:34:54,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622974092] [2022-12-06 06:34:54,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:54,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:34:54,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:54,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:34:54,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:34:54,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-06 06:34:54,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-06 06:34:54,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:54,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-06 06:34:54,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:54,780 INFO L130 PetriNetUnfolder]: 502/869 cut-off events. [2022-12-06 06:34:54,780 INFO L131 PetriNetUnfolder]: For 325/342 co-relation queries the response was YES. [2022-12-06 06:34:54,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1992 conditions, 869 events. 502/869 cut-off events. For 325/342 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4367 event pairs, 136 based on Foata normal form. 13/878 useless extension candidates. Maximal degree in co-relation 1979. Up to 589 conditions per place. [2022-12-06 06:34:54,785 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 24 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 06:34:54,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 153 flow [2022-12-06 06:34:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:34:54,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 06:34:54,787 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 77 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:34:54,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 153 flow [2022-12-06 06:34:54,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 145 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 06:34:54,789 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 80 flow [2022-12-06 06:34:54,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-06 06:34:54,790 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 06:34:54,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:54,790 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 80 flow [2022-12-06 06:34:54,791 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:54,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:54,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 80 flow [2022-12-06 06:34:54,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 80 flow [2022-12-06 06:34:54,798 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 06:34:54,798 INFO L131 PetriNetUnfolder]: For 15/19 co-relation queries the response was YES. [2022-12-06 06:34:54,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 29 events. 0/29 cut-off events. For 15/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-12-06 06:34:54,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 80 flow [2022-12-06 06:34:54,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 06:34:54,800 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:54,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 06:34:54,801 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 80 flow [2022-12-06 06:34:54,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-06 06:34:54,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:54,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:54,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:34:54,801 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:54,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:54,802 INFO L85 PathProgramCache]: Analyzing trace with hash -851597258, now seen corresponding path program 1 times [2022-12-06 06:34:54,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:54,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521582120] [2022-12-06 06:34:54,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:54,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:56,340 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-06 06:34:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:56,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521582120] [2022-12-06 06:34:56,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521582120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:56,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:56,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:34:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396463220] [2022-12-06 06:34:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:56,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:34:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:56,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:34:56,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:34:56,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:34:56,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-06 06:34:56,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:56,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:34:56,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:56,765 INFO L130 PetriNetUnfolder]: 1110/1751 cut-off events. [2022-12-06 06:34:56,765 INFO L131 PetriNetUnfolder]: For 1007/1040 co-relation queries the response was YES. [2022-12-06 06:34:56,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4053 conditions, 1751 events. 1110/1751 cut-off events. For 1007/1040 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8614 event pairs, 211 based on Foata normal form. 52/1801 useless extension candidates. Maximal degree in co-relation 4038. Up to 723 conditions per place. [2022-12-06 06:34:56,775 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 29 selfloop transitions, 3 changer transitions 14/48 dead transitions. [2022-12-06 06:34:56,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 236 flow [2022-12-06 06:34:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:34:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:34:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 06:34:56,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 06:34:56,777 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 80 flow. Second operand 5 states and 52 transitions. [2022-12-06 06:34:56,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 236 flow [2022-12-06 06:34:56,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:34:56,780 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 94 flow [2022-12-06 06:34:56,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2022-12-06 06:34:56,781 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-06 06:34:56,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:56,781 INFO L89 Accepts]: Start accepts. Operand has 40 places, 22 transitions, 94 flow [2022-12-06 06:34:56,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:56,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:56,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 22 transitions, 94 flow [2022-12-06 06:34:56,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 22 transitions, 94 flow [2022-12-06 06:34:56,814 INFO L130 PetriNetUnfolder]: 2/41 cut-off events. [2022-12-06 06:34:56,814 INFO L131 PetriNetUnfolder]: For 85/87 co-relation queries the response was YES. [2022-12-06 06:34:56,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 41 events. 2/41 cut-off events. For 85/87 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 109 event pairs, 2 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 94. Up to 11 conditions per place. [2022-12-06 06:34:56,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 22 transitions, 94 flow [2022-12-06 06:34:56,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-06 06:34:56,827 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:56,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 06:34:56,828 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 94 flow [2022-12-06 06:34:56,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-06 06:34:56,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:56,829 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:56,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:34:56,829 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash -629802842, now seen corresponding path program 1 times [2022-12-06 06:34:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:56,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801064465] [2022-12-06 06:34:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:57,605 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-06 06:34:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:57,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801064465] [2022-12-06 06:34:57,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801064465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:57,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:57,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:34:57,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477135186] [2022-12-06 06:34:57,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:57,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:34:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:57,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:34:57,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:34:57,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:34:57,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-06 06:34:57,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:57,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:34:57,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:57,881 INFO L130 PetriNetUnfolder]: 691/1126 cut-off events. [2022-12-06 06:34:57,882 INFO L131 PetriNetUnfolder]: For 1282/1295 co-relation queries the response was YES. [2022-12-06 06:34:57,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3024 conditions, 1126 events. 691/1126 cut-off events. For 1282/1295 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5118 event pairs, 403 based on Foata normal form. 9/1134 useless extension candidates. Maximal degree in co-relation 3006. Up to 947 conditions per place. [2022-12-06 06:34:57,889 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 23 selfloop transitions, 13 changer transitions 0/38 dead transitions. [2022-12-06 06:34:57,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 208 flow [2022-12-06 06:34:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:34:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:34:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 06:34:57,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41 [2022-12-06 06:34:57,891 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 94 flow. Second operand 5 states and 41 transitions. [2022-12-06 06:34:57,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 208 flow [2022-12-06 06:34:57,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 196 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 06:34:57,894 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 164 flow [2022-12-06 06:34:57,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2022-12-06 06:34:57,895 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2022-12-06 06:34:57,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:57,895 INFO L89 Accepts]: Start accepts. Operand has 41 places, 32 transitions, 164 flow [2022-12-06 06:34:57,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:57,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:57,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 164 flow [2022-12-06 06:34:57,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 164 flow [2022-12-06 06:34:57,935 INFO L130 PetriNetUnfolder]: 68/220 cut-off events. [2022-12-06 06:34:57,936 INFO L131 PetriNetUnfolder]: For 163/165 co-relation queries the response was YES. [2022-12-06 06:34:57,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 220 events. 68/220 cut-off events. For 163/165 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1169 event pairs, 16 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 575. Up to 87 conditions per place. [2022-12-06 06:34:57,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 164 flow [2022-12-06 06:34:57,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-06 06:34:57,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L790-->L792: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [756] $Ultimate##0-->L823: Formula: (let ((.cse6 (= (mod v_~y$r_buff1_thd3~0_119 256) 0)) (.cse15 (= (mod v_~y$w_buff1_used~0_367 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_358 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_116 256) 0))) (let ((.cse13 (not .cse12)) (.cse14 (not .cse16)) (.cse9 (select |v_#memory_int_419| |v_~#y~0.base_240|)) (.cse7 (and .cse12 .cse15)) (.cse8 (and .cse12 .cse6)) (.cse1 (= (mod v_~weak$$choice2~0_152 256) 0))) (let ((.cse2 (not .cse1)) (.cse5 (= (mod v_~y$w_buff1_used~0_366 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_357 256) 0)) (.cse10 (or .cse7 .cse16 .cse8)) (.cse0 (select .cse9 |v_~#y~0.offset_240|)) (.cse11 (and .cse13 .cse14))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$mem_tmp~0_92 .cse0) (or (and .cse1 (= |v_P2_#t~ite21_34| |v_P2_#t~mem20_39|) (= |v_P2_#t~mem20_39| v_~__unbuffered_p2_EAX~0_48)) (and .cse2 (= |v_P2_#t~ite21_34| v_~y$mem_tmp~0_92) (= |v_P2Thread1of1ForFork0_#t~mem20_10| |v_P2_#t~mem20_39|))) (= v_~y$w_buff0~0_203 v_~y$w_buff0~0_202) (= |v_P2Thread1of1ForFork0_#t~nondet14_10| v_~weak$$choice0~0_61) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse2 v_~y$r_buff1_thd3~0_119 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_115 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_119 0)) v_~y$r_buff1_thd3~0_118) (= v_~y$w_buff1_used~0_366 (ite .cse2 v_~y$w_buff1_used~0_367 (ite (or .cse7 .cse3 .cse8) v_~y$w_buff1_used~0_367 0))) (= (store |v_#memory_int_419| |v_~#y~0.base_240| (store .cse9 |v_~#y~0.offset_240| |v_P2_#t~ite21_34|)) |v_#memory_int_418|) (= v_~y$w_buff0_used~0_357 (ite .cse2 v_~y$w_buff0_used~0_358 (ite .cse10 v_~y$w_buff0_used~0_358 (ite .cse11 0 v_~y$w_buff0_used~0_358)))) (= v_~y$r_buff0_thd3~0_115 (ite .cse2 v_~y$r_buff0_thd3~0_116 (ite (or .cse3 .cse8 (and .cse12 .cse5)) v_~y$r_buff0_thd3~0_116 (ite (and .cse13 (not .cse3)) 0 v_~y$r_buff0_thd3~0_116)))) (or (and .cse10 (= |v_P2_#t~mem17_45| v_~__unbuffered_p2_EAX~0_48) (= |v_P2_#t~mem17_45| .cse0)) (and (= v_~__unbuffered_p2_EAX~0_48 (ite .cse11 v_~y$w_buff0~0_203 v_~y$w_buff1~0_207)) .cse14 (= |v_P2Thread1of1ForFork0_#t~mem17_10| |v_P2_#t~mem17_45|) (or .cse13 (not .cse6)) (or .cse13 (not .cse15)))) (= v_~y$w_buff1~0_207 v_~y$w_buff1~0_206) (= v_~y$flush_delayed~0_136 0) (= v_~weak$$choice2~0_152 |v_P2Thread1of1ForFork0_#t~nondet15_10|))))) InVars {~#y~0.offset=|v_~#y~0.offset_240|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_358, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_10|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_10|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_10|, ~#y~0.base=|v_~#y~0.base_240|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_207, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_116, ~y$w_buff0~0=v_~y$w_buff0~0_203, #memory_int=|v_#memory_int_419|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_367, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_10|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_7|, ~#y~0.offset=|v_~#y~0.offset_240|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ~#y~0.base=|v_~#y~0.base_240|, ~y$mem_tmp~0=v_~y$mem_tmp~0_92, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_118, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_115, ~y$w_buff0~0=v_~y$w_buff0~0_202, ~y$flush_delayed~0=v_~y$flush_delayed~0_136, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_206, #memory_int=|v_#memory_int_418|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_7|, ~weak$$choice2~0=v_~weak$$choice2~0_152, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_366} AuxVars[|v_P2_#t~mem20_39|, |v_P2_#t~mem17_45|, |v_P2_#t~ite21_34|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem17, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-06 06:34:59,274 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L790-->L792: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [720] $Ultimate##0-->L775: Formula: (let ((.cse16 (= (mod v_~y$w_buff0_used~0_326 256) 0)) (.cse11 (= (mod v_~y$w_buff1_used~0_335 256) 0)) (.cse10 (= (mod v_~y$r_buff1_thd1~0_58 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd1~0_63 256) 0))) (let ((.cse13 (= (mod v_~weak$$choice2~0_140 256) 0)) (.cse3 (select |v_#memory_int_357| |v_~#y~0.base_220|)) (.cse4 (and .cse10 .cse6)) (.cse14 (and .cse11 .cse6)) (.cse9 (not .cse16)) (.cse8 (not .cse6))) (let ((.cse2 (and .cse9 .cse8)) (.cse1 (or .cse4 .cse16 .cse14)) (.cse12 (select .cse3 |v_~#y~0.offset_220|)) (.cse0 (not .cse13)) (.cse5 (= (mod v_~y$w_buff1_used~0_334 256) 0)) (.cse7 (= (mod v_~y$w_buff0_used~0_325 256) 0))) (and (= v_~y$flush_delayed~0_122 0) (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_50 |v_~#y~0.offset_220|) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= (ite .cse0 v_~y$w_buff0_used~0_326 (ite .cse1 v_~y$w_buff0_used~0_326 (ite .cse2 0 v_~y$w_buff0_used~0_326))) v_~y$w_buff0_used~0_325) (= (store |v_#memory_int_357| |v_~#y~0.base_220| (store .cse3 |v_~#y~0.offset_220| |v_P0_#t~ite10_30|)) |v_#memory_int_356|) (= v_~weak$$choice2~0_140 |v_P0Thread1of1ForFork1_#t~nondet4_10|) (= v_~y$w_buff1~0_187 v_~y$w_buff1~0_186) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork1_#t~nondet3_10| v_~weak$$choice0~0_53) (= (ite .cse0 v_~y$r_buff0_thd1~0_63 (ite (or .cse4 (and .cse5 .cse6) .cse7) v_~y$r_buff0_thd1~0_63 (ite (and (not .cse7) .cse8) 0 v_~y$r_buff0_thd1~0_63))) v_~y$r_buff0_thd1~0_62) (= |v_~#y~0.base_220| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_50) (or (and .cse9 (= (ite .cse2 v_~y$w_buff0~0_183 v_~y$w_buff1~0_187) v_~__unbuffered_p0_EAX~0_77) (or (not .cse10) .cse8) (= |v_P0Thread1of1ForFork1_#t~mem6_10| |v_P0_#t~mem6_47|) (or (not .cse11) .cse8)) (and (= .cse12 |v_P0_#t~mem6_47|) (= v_~__unbuffered_p0_EAX~0_77 |v_P0_#t~mem6_47|) .cse1)) (= v_~y$w_buff0~0_183 v_~y$w_buff0~0_182) (or (and .cse0 (= |v_P0_#t~ite10_30| v_~y$mem_tmp~0_80) (= |v_P0Thread1of1ForFork1_#t~mem9_10| |v_P0_#t~mem9_31|)) (and .cse13 (= |v_P0_#t~ite10_30| |v_P0_#t~mem9_31|) (= v_~__unbuffered_p0_EAX~0_77 |v_P0_#t~mem9_31|))) (= v_~__unbuffered_p0_EAX$read_delayed~0_49 1) (= v_~y$w_buff1_used~0_334 (ite .cse0 v_~y$w_buff1_used~0_335 (ite (or .cse4 .cse7 .cse14) v_~y$w_buff1_used~0_335 0))) (= .cse12 v_~y$mem_tmp~0_80) (= (ite .cse0 v_~y$r_buff1_thd1~0_58 (ite (let ((.cse15 (= 0 (mod v_~y$r_buff0_thd1~0_62 256)))) (or (and .cse5 .cse15) (and .cse10 .cse15) .cse7)) v_~y$r_buff1_thd1~0_58 0)) v_~y$r_buff1_thd1~0_57))))) InVars {~#y~0.offset=|v_~#y~0.offset_220|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_326, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_10|, ~#y~0.base=|v_~#y~0.base_220|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_10|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_58, ~y$w_buff1~0=v_~y$w_buff1~0_187, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_183, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_63, #memory_int=|v_#memory_int_357|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_10|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_10|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_335} OutVars{P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_7|, ~#y~0.offset=|v_~#y~0.offset_220|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_325, ~#y~0.base=|v_~#y~0.base_220|, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_7|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_7|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_182, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_62, ~y$flush_delayed~0=v_~y$flush_delayed~0_122, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_49, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_50, ~weak$$choice0~0=v_~weak$$choice0~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_186, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_7|, #memory_int=|v_#memory_int_356|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_50, ~weak$$choice2~0=v_~weak$$choice2~0_140, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_334} AuxVars[|v_P0_#t~mem9_31|, |v_P0_#t~ite10_30|, |v_P0_#t~mem6_47|] AssignedVars[P0Thread1of1ForFork1_#t~ite10, ~y$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem9, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem6, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p0_EAX$read_delayed~0, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-06 06:34:59,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L790-->L792: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [636] L860-->L866: Formula: (let ((.cse4 (= (mod v_~y$r_buff0_thd0~0_72 256) 0))) (let ((.cse10 (= (mod v_~y$w_buff1_used~0_261 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd0~0_73 256) 0)) (.cse1 (not .cse4)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_253 256) 0))) (.cse5 (= (mod v_~y$w_buff0_used~0_254 256) 0))) (let ((.cse8 (select |v_#memory_int_271| |v_~#y~0.base_186|)) (.cse2 (not .cse5)) (.cse0 (and .cse1 .cse11)) (.cse6 (not .cse9)) (.cse7 (not .cse10))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_72) v_~y$r_buff0_thd0~0_71) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem31#1_31| |v_ULTIMATE.start_main_#t~mem31#1_27|))) (or (and .cse1 .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite32#1_28| |v_ULTIMATE.start_main_#t~ite32#1_24|) (= |v_ULTIMATE.start_main_#t~ite33#1_24| v_~y$w_buff0~0_130)) (and (or .cse4 .cse5) (= |v_ULTIMATE.start_main_#t~ite33#1_24| |v_ULTIMATE.start_main_#t~ite32#1_28|) (or (and .cse6 (= v_~y$w_buff1~0_134 |v_ULTIMATE.start_main_#t~ite32#1_28|) .cse7 .cse3) (and (= |v_ULTIMATE.start_main_#t~mem31#1_31| |v_ULTIMATE.start_main_#t~ite32#1_28|) (= (select .cse8 |v_~#y~0.offset_186|) |v_ULTIMATE.start_main_#t~mem31#1_31|) (or .cse9 .cse10)))))) (= (store |v_#memory_int_271| |v_~#y~0.base_186| (store .cse8 |v_~#y~0.offset_186| |v_ULTIMATE.start_main_#t~ite33#1_24|)) |v_#memory_int_270|) (= v_~y$r_buff1_thd0~0_72 (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_260 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_71 256) 0)) .cse11)) 0 v_~y$r_buff1_thd0~0_73)) (= v_~y$w_buff0_used~0_253 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_254)) (= (ite (or .cse0 (and .cse6 .cse7)) 0 v_~y$w_buff1_used~0_261) v_~y$w_buff1_used~0_260))))) InVars {~#y~0.offset=|v_~#y~0.offset_186|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$w_buff1~0=v_~y$w_buff1~0_134, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~y$w_buff0~0=v_~y$w_buff0~0_130, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_24|, #memory_int=|v_#memory_int_271|, ~#y~0.base=|v_~#y~0.base_186|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_261} OutVars{~#y~0.offset=|v_~#y~0.offset_186|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$w_buff1~0=v_~y$w_buff1~0_134, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_20|, ~y$w_buff0~0=v_~y$w_buff0~0_130, #memory_int=|v_#memory_int_270|, ~#y~0.base=|v_~#y~0.base_186|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_260} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_28|, |v_ULTIMATE.start_main_#t~ite33#1_24|, |v_ULTIMATE.start_main_#t~mem31#1_31|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:35:00,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L790-->L792: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [739] L853-3-->L855-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1815~0#1.base_16| 0)) (= |v_#length_56| (store |v_#length_57| |v_ULTIMATE.start_main_~#t1815~0#1.base_16| 4)) (= (select |v_#valid_64| |v_ULTIMATE.start_main_~#t1815~0#1.base_16|) 0) (= |v_ULTIMATE.start_main_~#t1815~0#1.offset_16| 0) (= |v_#pthreadsForks_33| |v_ULTIMATE.start_main_#t~pre29#1_19|) (= (store |v_#valid_64| |v_ULTIMATE.start_main_~#t1815~0#1.base_16| 1) |v_#valid_63|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#t1815~0#1.base_16| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#t1815~0#1.base_16|) |v_ULTIMATE.start_main_~#t1815~0#1.offset_16| |v_ULTIMATE.start_main_#t~pre29#1_19|)) |v_#memory_int_400|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1)) (< |v_#StackHeapBarrier_25| |v_ULTIMATE.start_main_~#t1815~0#1.base_16|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_25|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_401|, #length=|v_#length_57|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_25|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_19|, #pthreadsForks=|v_#pthreadsForks_32|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_17|, ULTIMATE.start_main_~#t1815~0#1.offset=|v_ULTIMATE.start_main_~#t1815~0#1.offset_16|, #length=|v_#length_56|, ULTIMATE.start_main_~#t1815~0#1.base=|v_ULTIMATE.start_main_~#t1815~0#1.base_16|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, #valid, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_~#t1815~0#1.offset, #length, ULTIMATE.start_main_~#t1815~0#1.base, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 06:35:00,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [775] L790-->L866: Formula: (let ((.cse6 (= (mod v_~y$r_buff0_thd0~0_246 256) 0))) (let ((.cse9 (= (mod v_~y$r_buff1_thd0~0_243 256) 0)) (.cse7 (= (mod v_~y$w_buff0_used~0_596 256) 0)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_595 256) 0))) (.cse4 (not .cse6)) (.cse8 (= (mod v_~y$w_buff1_used~0_605 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (and .cse10 .cse4)) (.cse3 (not .cse7)) (.cse0 (not .cse9))) (and (= v_~y$w_buff1_used~0_604 (ite (or (and .cse0 .cse1) .cse2) 0 v_~y$w_buff1_used~0_605)) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~mem31#1_176| |v_ULTIMATE.start_main_#t~mem31#1_174|))) (or (and (= |v_ULTIMATE.start_main_#t~ite32#1_173| |v_ULTIMATE.start_main_#t~ite32#1_171|) .cse3 (= |v_ULTIMATE.start_main_#t~ite33#1_137| v_~y$w_buff0~0_362) .cse4 .cse5) (and (or .cse6 .cse7) (= |v_ULTIMATE.start_main_#t~ite33#1_137| |v_ULTIMATE.start_main_#t~ite32#1_171|) (or (and (or .cse8 .cse9) (= |v_ULTIMATE.start_main_#t~mem31#1_174| |v_ULTIMATE.start_main_#t~ite32#1_171|) (= |v_ULTIMATE.start_main_#t~mem31#1_174| 1)) (and .cse0 (= v_~y$w_buff1~0_366 |v_ULTIMATE.start_main_#t~ite32#1_171|) .cse1 .cse5))))) (= v_~y$r_buff0_thd0~0_245 (ite .cse2 0 v_~y$r_buff0_thd0~0_246)) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_596) v_~y$w_buff0_used~0_595) (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_604 256) 0))) (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_245 256) 0)))) 0 v_~y$r_buff1_thd0~0_243) v_~y$r_buff1_thd0~0_242) (= (store |v_#memory_int_727| |v_~#y~0.base_352| (store (select |v_#memory_int_727| |v_~#y~0.base_352|) |v_~#y~0.offset_352| |v_ULTIMATE.start_main_#t~ite33#1_137|)) |v_#memory_int_725|))))) InVars {~#y~0.offset=|v_~#y~0.offset_352|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_596, ~y$w_buff1~0=v_~y$w_buff1~0_366, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_176|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_246, ~y$w_buff0~0=v_~y$w_buff0~0_362, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_173|, #memory_int=|v_#memory_int_727|, ~#y~0.base=|v_~#y~0.base_352|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_243, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_605} OutVars{~#y~0.offset=|v_~#y~0.offset_352|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ~y$w_buff1~0=v_~y$w_buff1~0_366, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_245, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_136|, ~y$w_buff0~0=v_~y$w_buff0~0_362, #memory_int=|v_#memory_int_725|, ~#y~0.base=|v_~#y~0.base_352|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_242, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_604} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_171|, |v_ULTIMATE.start_main_#t~mem31#1_174|, |v_ULTIMATE.start_main_#t~ite33#1_137|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [756] $Ultimate##0-->L823: Formula: (let ((.cse6 (= (mod v_~y$r_buff1_thd3~0_119 256) 0)) (.cse15 (= (mod v_~y$w_buff1_used~0_367 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_358 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_116 256) 0))) (let ((.cse13 (not .cse12)) (.cse14 (not .cse16)) (.cse9 (select |v_#memory_int_419| |v_~#y~0.base_240|)) (.cse7 (and .cse12 .cse15)) (.cse8 (and .cse12 .cse6)) (.cse1 (= (mod v_~weak$$choice2~0_152 256) 0))) (let ((.cse2 (not .cse1)) (.cse5 (= (mod v_~y$w_buff1_used~0_366 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_357 256) 0)) (.cse10 (or .cse7 .cse16 .cse8)) (.cse0 (select .cse9 |v_~#y~0.offset_240|)) (.cse11 (and .cse13 .cse14))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$mem_tmp~0_92 .cse0) (or (and .cse1 (= |v_P2_#t~ite21_34| |v_P2_#t~mem20_39|) (= |v_P2_#t~mem20_39| v_~__unbuffered_p2_EAX~0_48)) (and .cse2 (= |v_P2_#t~ite21_34| v_~y$mem_tmp~0_92) (= |v_P2Thread1of1ForFork0_#t~mem20_10| |v_P2_#t~mem20_39|))) (= v_~y$w_buff0~0_203 v_~y$w_buff0~0_202) (= |v_P2Thread1of1ForFork0_#t~nondet14_10| v_~weak$$choice0~0_61) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse2 v_~y$r_buff1_thd3~0_119 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_115 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_119 0)) v_~y$r_buff1_thd3~0_118) (= v_~y$w_buff1_used~0_366 (ite .cse2 v_~y$w_buff1_used~0_367 (ite (or .cse7 .cse3 .cse8) v_~y$w_buff1_used~0_367 0))) (= (store |v_#memory_int_419| |v_~#y~0.base_240| (store .cse9 |v_~#y~0.offset_240| |v_P2_#t~ite21_34|)) |v_#memory_int_418|) (= v_~y$w_buff0_used~0_357 (ite .cse2 v_~y$w_buff0_used~0_358 (ite .cse10 v_~y$w_buff0_used~0_358 (ite .cse11 0 v_~y$w_buff0_used~0_358)))) (= v_~y$r_buff0_thd3~0_115 (ite .cse2 v_~y$r_buff0_thd3~0_116 (ite (or .cse3 .cse8 (and .cse12 .cse5)) v_~y$r_buff0_thd3~0_116 (ite (and .cse13 (not .cse3)) 0 v_~y$r_buff0_thd3~0_116)))) (or (and .cse10 (= |v_P2_#t~mem17_45| v_~__unbuffered_p2_EAX~0_48) (= |v_P2_#t~mem17_45| .cse0)) (and (= v_~__unbuffered_p2_EAX~0_48 (ite .cse11 v_~y$w_buff0~0_203 v_~y$w_buff1~0_207)) .cse14 (= |v_P2Thread1of1ForFork0_#t~mem17_10| |v_P2_#t~mem17_45|) (or .cse13 (not .cse6)) (or .cse13 (not .cse15)))) (= v_~y$w_buff1~0_207 v_~y$w_buff1~0_206) (= v_~y$flush_delayed~0_136 0) (= v_~weak$$choice2~0_152 |v_P2Thread1of1ForFork0_#t~nondet15_10|))))) InVars {~#y~0.offset=|v_~#y~0.offset_240|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_358, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_10|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_10|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_10|, ~#y~0.base=|v_~#y~0.base_240|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_207, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_116, ~y$w_buff0~0=v_~y$w_buff0~0_203, #memory_int=|v_#memory_int_419|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_367, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_10|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_7|, ~#y~0.offset=|v_~#y~0.offset_240|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ~#y~0.base=|v_~#y~0.base_240|, ~y$mem_tmp~0=v_~y$mem_tmp~0_92, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_118, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_115, ~y$w_buff0~0=v_~y$w_buff0~0_202, ~y$flush_delayed~0=v_~y$flush_delayed~0_136, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_206, #memory_int=|v_#memory_int_418|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_7|, ~weak$$choice2~0=v_~weak$$choice2~0_152, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_366} AuxVars[|v_P2_#t~mem20_39|, |v_P2_#t~mem17_45|, |v_P2_#t~ite21_34|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem17, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-06 06:35:01,843 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:35:01,844 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3949 [2022-12-06 06:35:01,844 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 181 flow [2022-12-06 06:35:01,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-06 06:35:01,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:01,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:01,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:35:01,845 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:35:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash 77729764, now seen corresponding path program 1 times [2022-12-06 06:35:01,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:01,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627270019] [2022-12-06 06:35:01,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:02,954 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-06 06:35:02,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:02,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627270019] [2022-12-06 06:35:02,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627270019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:02,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:02,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:35:02,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417593529] [2022-12-06 06:35:02,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:02,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:35:02,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:02,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:35:02,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:35:02,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:35:02,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-06 06:35:02,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:02,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:35:02,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:03,364 INFO L130 PetriNetUnfolder]: 742/1201 cut-off events. [2022-12-06 06:35:03,365 INFO L131 PetriNetUnfolder]: For 1712/1727 co-relation queries the response was YES. [2022-12-06 06:35:03,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3800 conditions, 1201 events. 742/1201 cut-off events. For 1712/1727 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5724 event pairs, 192 based on Foata normal form. 16/1214 useless extension candidates. Maximal degree in co-relation 3782. Up to 763 conditions per place. [2022-12-06 06:35:03,372 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 27 selfloop transitions, 17 changer transitions 0/46 dead transitions. [2022-12-06 06:35:03,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 324 flow [2022-12-06 06:35:03,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:35:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:35:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 06:35:03,375 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2022-12-06 06:35:03,375 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 181 flow. Second operand 5 states and 47 transitions. [2022-12-06 06:35:03,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 324 flow [2022-12-06 06:35:03,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 317 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 06:35:03,379 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 266 flow [2022-12-06 06:35:03,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2022-12-06 06:35:03,380 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2022-12-06 06:35:03,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:03,380 INFO L89 Accepts]: Start accepts. Operand has 45 places, 36 transitions, 266 flow [2022-12-06 06:35:03,381 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:03,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:03,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 266 flow [2022-12-06 06:35:03,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 266 flow [2022-12-06 06:35:03,425 INFO L130 PetriNetUnfolder]: 83/241 cut-off events. [2022-12-06 06:35:03,425 INFO L131 PetriNetUnfolder]: For 605/643 co-relation queries the response was YES. [2022-12-06 06:35:03,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 241 events. 83/241 cut-off events. For 605/643 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1353 event pairs, 13 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 819. Up to 102 conditions per place. [2022-12-06 06:35:03,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 266 flow [2022-12-06 06:35:03,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 06:35:03,449 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:35:03,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 06:35:03,450 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 266 flow [2022-12-06 06:35:03,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-06 06:35:03,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:03,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:03,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:35:03,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:35:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1582407484, now seen corresponding path program 1 times [2022-12-06 06:35:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:03,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556936886] [2022-12-06 06:35:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:03,642 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-06 06:35:03,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:03,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556936886] [2022-12-06 06:35:03,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556936886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:03,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:03,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:35:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269300316] [2022-12-06 06:35:03,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:03,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:35:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:03,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:35:03,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:35:03,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 06:35:03,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 06:35:03,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:03,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 06:35:03,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:03,862 INFO L130 PetriNetUnfolder]: 438/786 cut-off events. [2022-12-06 06:35:03,862 INFO L131 PetriNetUnfolder]: For 2295/2305 co-relation queries the response was YES. [2022-12-06 06:35:03,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 786 events. 438/786 cut-off events. For 2295/2305 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3787 event pairs, 84 based on Foata normal form. 33/814 useless extension candidates. Maximal degree in co-relation 2808. Up to 628 conditions per place. [2022-12-06 06:35:03,868 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 46 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2022-12-06 06:35:03,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 494 flow [2022-12-06 06:35:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:35:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:35:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 06:35:03,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 06:35:03,870 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 266 flow. Second operand 3 states and 44 transitions. [2022-12-06 06:35:03,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 494 flow [2022-12-06 06:35:03,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 472 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 06:35:03,875 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 277 flow [2022-12-06 06:35:03,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=277, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-06 06:35:03,875 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2022-12-06 06:35:03,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:03,876 INFO L89 Accepts]: Start accepts. Operand has 46 places, 39 transitions, 277 flow [2022-12-06 06:35:03,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:03,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:03,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 277 flow [2022-12-06 06:35:03,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 277 flow [2022-12-06 06:35:03,934 INFO L130 PetriNetUnfolder]: 156/384 cut-off events. [2022-12-06 06:35:03,935 INFO L131 PetriNetUnfolder]: For 711/737 co-relation queries the response was YES. [2022-12-06 06:35:03,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 384 events. 156/384 cut-off events. For 711/737 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2210 event pairs, 37 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 1162. Up to 156 conditions per place. [2022-12-06 06:35:03,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 277 flow [2022-12-06 06:35:03,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 06:35:03,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [745] L855-3-->L860: Formula: (and (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| 0)) (= v_~main$tmp_guard0~0_32 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_75) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_9|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [777] L790-->L823: Formula: (let ((.cse21 (= (mod v_~y$w_buff0_used~0_601 256) 0)) (.cse20 (= (mod v_~y$r_buff0_thd0~0_250 256) 0))) (let ((.cse15 (not .cse20)) (.cse16 (not .cse21))) (let ((.cse1 (ite (and .cse15 .cse16) 0 v_~y$w_buff0_used~0_601))) (let ((.cse27 (= (mod .cse1 256) 0))) (let ((.cse18 (= (mod v_~y$w_buff1_used~0_610 256) 0)) (.cse19 (= (mod v_~y$r_buff1_thd0~0_247 256) 0)) (.cse10 (not .cse27))) (let ((.cse5 (and .cse15 .cse10)) (.cse11 (not .cse19)) (.cse17 (not .cse18))) (let ((.cse24 (ite (or .cse5 (and .cse11 .cse17)) 0 v_~y$w_buff1_used~0_610))) (let ((.cse7 (= (mod v_~y$r_buff1_thd3~0_187 256) 0)) (.cse26 (= (mod .cse24 256) 0)) (.cse22 (= (mod v_~y$r_buff0_thd3~0_182 256) 0))) (let ((.cse4 (= (mod v_~weak$$choice2~0_220 256) 0)) (.cse13 (not .cse22)) (.cse25 (and .cse22 .cse26)) (.cse23 (and .cse22 .cse7))) (let ((.cse2 (or .cse25 .cse27 .cse23)) (.cse12 (not .cse26)) (.cse3 (and .cse13 .cse10)) (.cse8 (= (mod v_~y$w_buff1_used~0_608 256) 0)) (.cse0 (not .cse4)) (.cse9 (= (mod v_~y$w_buff0_used~0_599 256) 0))) (and (= v_~y$w_buff0_used~0_599 (ite .cse0 .cse1 (ite .cse2 .cse1 (ite .cse3 0 .cse1)))) (or (and (= |v_P2_#t~ite21_47| |v_P2_#t~mem20_52|) .cse4 (= |v_P2_#t~mem20_52| v_~__unbuffered_p2_EAX~0_86)) (and .cse0 (= |v_P2_#t~ite21_47| v_~y$mem_tmp~0_160) (= |v_P2Thread1of1ForFork0_#t~mem20_30| |v_P2_#t~mem20_52|))) (= v_~y$r_buff0_thd0~0_249 (ite .cse5 0 v_~y$r_buff0_thd0~0_250)) (= v_~weak$$choice2~0_220 |v_P2Thread1of1ForFork0_#t~nondet15_30|) (= v_~y$flush_delayed~0_204 0) (= (ite .cse0 v_~y$r_buff1_thd3~0_187 (ite (let ((.cse6 (= 0 (mod v_~y$r_buff0_thd3~0_181 256)))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse9)) v_~y$r_buff1_thd3~0_187 0)) v_~y$r_buff1_thd3~0_186) (= |v_P2Thread1of1ForFork0_#t~nondet14_30| v_~weak$$choice0~0_129) (= (store |v_#memory_int_739| |v_~#y~0.base_356| (store (select |v_#memory_int_739| |v_~#y~0.base_356|) |v_~#y~0.offset_356| |v_P2_#t~ite21_47|)) |v_#memory_int_737|) (= v_~y$w_buff0~0_365 v_~y$w_buff0~0_364) (= v_~y$w_buff1~0_369 v_~y$w_buff1~0_368) (= v_~y$r_buff1_thd0~0_246 (ite (or (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_249 256) 0))) (and .cse11 .cse12)) 0 v_~y$r_buff1_thd0~0_247)) (or (and (= |v_P2_#t~mem17_58| v_~__unbuffered_p2_EAX~0_86) (= v_~y$mem_tmp~0_160 |v_P2_#t~mem17_58|) .cse2) (and (= |v_P2Thread1of1ForFork0_#t~mem17_30| |v_P2_#t~mem17_58|) (or (not .cse7) .cse13) .cse10 (or .cse13 .cse12) (= (ite .cse3 v_~y$w_buff0~0_365 v_~y$w_buff1~0_369) v_~__unbuffered_p2_EAX~0_86))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem31#1_182| |v_ULTIMATE.start_main_#t~mem31#1_180|))) (or (and (= v_~y$mem_tmp~0_160 v_~y$w_buff0~0_365) (= |v_ULTIMATE.start_main_#t~ite32#1_179| |v_ULTIMATE.start_main_#t~ite32#1_177|) .cse14 .cse15 .cse16) (and (= v_~y$mem_tmp~0_160 |v_ULTIMATE.start_main_#t~ite32#1_177|) (or (and .cse11 .cse14 (= v_~y$w_buff1~0_369 |v_ULTIMATE.start_main_#t~ite32#1_177|) .cse17) (and (or .cse18 .cse19) (= |v_ULTIMATE.start_main_#t~mem31#1_180| 1) (= |v_ULTIMATE.start_main_#t~mem31#1_180| |v_ULTIMATE.start_main_#t~ite32#1_177|))) (or .cse20 .cse21)))) (= |v_P2Thread1of1ForFork0_#in~arg.base_15| v_P2Thread1of1ForFork0_~arg.base_15) (= (ite .cse0 v_~y$r_buff0_thd3~0_182 (ite (or (and .cse22 .cse8) .cse9 .cse23) v_~y$r_buff0_thd3~0_182 (ite (and .cse13 (not .cse9)) 0 v_~y$r_buff0_thd3~0_182))) v_~y$r_buff0_thd3~0_181) (= |v_P2Thread1of1ForFork0_#in~arg.offset_15| v_P2Thread1of1ForFork0_~arg.offset_15) (= (ite .cse0 .cse24 (ite (or .cse9 .cse25 .cse23) .cse24 0)) v_~y$w_buff1_used~0_608)))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_356|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_601, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_30|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_30|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_30|, ~#y~0.base=|v_~#y~0.base_356|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_187, ~y$w_buff1~0=v_~y$w_buff1~0_369, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_182|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_182, ~y$w_buff0~0=v_~y$w_buff0~0_365, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_250, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_179|, #memory_int=|v_#memory_int_739|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_247, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_610, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_30|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_17|, ~#y~0.offset=|v_~#y~0.offset_356|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_599, ~#y~0.base=|v_~#y~0.base_356|, ~y$mem_tmp~0=v_~y$mem_tmp~0_160, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_186, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_17|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_181, ~y$w_buff0~0=v_~y$w_buff0~0_364, ~y$flush_delayed~0=v_~y$flush_delayed~0_204, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_15, ~weak$$choice0~0=v_~weak$$choice0~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_368, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_249, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_140|, #memory_int=|v_#memory_int_737|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_17|, ~weak$$choice2~0=v_~weak$$choice2~0_220, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_246, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_608} AuxVars[|v_ULTIMATE.start_main_#t~mem31#1_180|, |v_ULTIMATE.start_main_#t~ite32#1_177|, |v_P2_#t~mem17_58|, |v_P2_#t~ite21_47|, |v_P2_#t~mem20_52|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~mem17, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, #memory_int, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-06 06:35:05,087 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:35:05,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1212 [2022-12-06 06:35:05,088 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 279 flow [2022-12-06 06:35:05,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 06:35:05,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:05,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:05,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:35:05,088 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:35:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1193998603, now seen corresponding path program 1 times [2022-12-06 06:35:05,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:05,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639580915] [2022-12-06 06:35:05,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:05,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:05,286 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-06 06:35:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:05,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639580915] [2022-12-06 06:35:05,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639580915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:05,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:05,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:35:05,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593894957] [2022-12-06 06:35:05,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:05,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:35:05,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:05,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:35:05,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:35:05,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 06:35:05,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-06 06:35:05,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:05,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 06:35:05,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:05,455 INFO L130 PetriNetUnfolder]: 229/457 cut-off events. [2022-12-06 06:35:05,455 INFO L131 PetriNetUnfolder]: For 1208/1209 co-relation queries the response was YES. [2022-12-06 06:35:05,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1866 conditions, 457 events. 229/457 cut-off events. For 1208/1209 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2070 event pairs, 28 based on Foata normal form. 46/498 useless extension candidates. Maximal degree in co-relation 1844. Up to 161 conditions per place. [2022-12-06 06:35:05,458 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 50 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-06 06:35:05,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 531 flow [2022-12-06 06:35:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:35:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:35:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 06:35:05,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2022-12-06 06:35:05,460 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 279 flow. Second operand 4 states and 55 transitions. [2022-12-06 06:35:05,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 531 flow [2022-12-06 06:35:05,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 525 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 06:35:05,463 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 279 flow [2022-12-06 06:35:05,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2022-12-06 06:35:05,464 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2022-12-06 06:35:05,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:05,464 INFO L89 Accepts]: Start accepts. Operand has 49 places, 39 transitions, 279 flow [2022-12-06 06:35:05,465 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:05,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:05,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 279 flow [2022-12-06 06:35:05,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 279 flow [2022-12-06 06:35:05,499 INFO L130 PetriNetUnfolder]: 63/207 cut-off events. [2022-12-06 06:35:05,500 INFO L131 PetriNetUnfolder]: For 441/499 co-relation queries the response was YES. [2022-12-06 06:35:05,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 207 events. 63/207 cut-off events. For 441/499 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1017 event pairs, 7 based on Foata normal form. 12/206 useless extension candidates. Maximal degree in co-relation 729. Up to 83 conditions per place. [2022-12-06 06:35:05,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 279 flow [2022-12-06 06:35:05,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-06 06:35:05,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:35:05,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 480 [2022-12-06 06:35:05,944 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 283 flow [2022-12-06 06:35:05,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-06 06:35:05,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:05,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:05,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:35:05,945 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:35:05,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:05,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2010556960, now seen corresponding path program 1 times [2022-12-06 06:35:05,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:05,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813503923] [2022-12-06 06:35:05,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:05,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:06,257 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-06 06:35:06,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:06,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813503923] [2022-12-06 06:35:06,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813503923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:06,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:06,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:35:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371232271] [2022-12-06 06:35:06,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:06,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:35:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:06,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:35:06,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:35:06,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 06:35:06,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-06 06:35:06,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:06,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 06:35:06,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:06,417 INFO L130 PetriNetUnfolder]: 188/368 cut-off events. [2022-12-06 06:35:06,418 INFO L131 PetriNetUnfolder]: For 1189/1189 co-relation queries the response was YES. [2022-12-06 06:35:06,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1639 conditions, 368 events. 188/368 cut-off events. For 1189/1189 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1617 event pairs, 23 based on Foata normal form. 21/384 useless extension candidates. Maximal degree in co-relation 1615. Up to 158 conditions per place. [2022-12-06 06:35:06,421 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 41 selfloop transitions, 10 changer transitions 6/60 dead transitions. [2022-12-06 06:35:06,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 539 flow [2022-12-06 06:35:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:35:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:35:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 06:35:06,422 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 06:35:06,422 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 283 flow. Second operand 5 states and 57 transitions. [2022-12-06 06:35:06,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 539 flow [2022-12-06 06:35:06,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 467 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 06:35:06,428 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 223 flow [2022-12-06 06:35:06,428 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2022-12-06 06:35:06,429 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2022-12-06 06:35:06,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:06,429 INFO L89 Accepts]: Start accepts. Operand has 48 places, 34 transitions, 223 flow [2022-12-06 06:35:06,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:06,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:06,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 34 transitions, 223 flow [2022-12-06 06:35:06,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 34 transitions, 223 flow [2022-12-06 06:35:06,442 INFO L130 PetriNetUnfolder]: 14/55 cut-off events. [2022-12-06 06:35:06,442 INFO L131 PetriNetUnfolder]: For 101/115 co-relation queries the response was YES. [2022-12-06 06:35:06,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 55 events. 14/55 cut-off events. For 101/115 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 117 event pairs, 0 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 175. Up to 17 conditions per place. [2022-12-06 06:35:06,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 34 transitions, 223 flow [2022-12-06 06:35:06,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 06:35:20,537 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:35:20,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14109 [2022-12-06 06:35:20,538 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 225 flow [2022-12-06 06:35:20,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-06 06:35:20,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:20,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:20,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:35:20,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:35:20,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash -215717566, now seen corresponding path program 1 times [2022-12-06 06:35:20,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:20,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135884783] [2022-12-06 06:35:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:20,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:35:20,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:35:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:35:20,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:35:20,717 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:35:20,719 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 06:35:20,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 06:35:20,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 06:35:20,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 06:35:20,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:35:20,723 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:20,727 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:35:20,727 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:35:20,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:35:20 BasicIcfg [2022-12-06 06:35:20,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:35:20,818 INFO L158 Benchmark]: Toolchain (without parser) took 41641.04ms. Allocated memory was 199.2MB in the beginning and 755.0MB in the end (delta: 555.7MB). Free memory was 173.6MB in the beginning and 510.2MB in the end (delta: -336.6MB). Peak memory consumption was 219.6MB. Max. memory is 8.0GB. [2022-12-06 06:35:20,819 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:35:20,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.01ms. Allocated memory is still 199.2MB. Free memory was 173.6MB in the beginning and 145.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:35:20,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.04ms. Allocated memory is still 199.2MB. Free memory was 144.8MB in the beginning and 142.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:35:20,819 INFO L158 Benchmark]: Boogie Preprocessor took 33.32ms. Allocated memory is still 199.2MB. Free memory was 142.2MB in the beginning and 139.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:35:20,819 INFO L158 Benchmark]: RCFGBuilder took 1155.20ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 139.6MB in the beginning and 180.9MB in the end (delta: -41.3MB). Peak memory consumption was 54.0MB. Max. memory is 8.0GB. [2022-12-06 06:35:20,820 INFO L158 Benchmark]: TraceAbstraction took 39871.42ms. Allocated memory was 239.1MB in the beginning and 755.0MB in the end (delta: 515.9MB). Free memory was 180.4MB in the beginning and 510.2MB in the end (delta: -329.8MB). Peak memory consumption was 185.5MB. Max. memory is 8.0GB. [2022-12-06 06:35:20,821 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.13ms. Allocated memory is still 199.2MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 520.01ms. Allocated memory is still 199.2MB. Free memory was 173.6MB in the beginning and 145.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.04ms. Allocated memory is still 199.2MB. Free memory was 144.8MB in the beginning and 142.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.32ms. Allocated memory is still 199.2MB. Free memory was 142.2MB in the beginning and 139.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1155.20ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 139.6MB in the beginning and 180.9MB in the end (delta: -41.3MB). Peak memory consumption was 54.0MB. Max. memory is 8.0GB. * TraceAbstraction took 39871.42ms. Allocated memory was 239.1MB in the beginning and 755.0MB in the end (delta: 515.9MB). Free memory was 180.4MB in the beginning and 510.2MB in the end (delta: -329.8MB). Peak memory consumption was 185.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.8s, 118 PlacesBefore, 30 PlacesAfterwards, 109 TransitionsBefore, 21 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 916, independent: 846, independent conditional: 846, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 916, independent: 846, independent conditional: 0, independent unconditional: 846, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 916, independent: 846, independent conditional: 0, independent unconditional: 846, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 916, independent: 846, independent conditional: 0, independent unconditional: 846, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 738, independent: 703, independent conditional: 0, independent unconditional: 703, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 738, independent: 687, independent conditional: 0, independent unconditional: 687, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 572, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 554, dependent conditional: 0, dependent unconditional: 554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 916, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 738, unknown conditional: 0, unknown unconditional: 738] , Statistics on independence cache: Total cache size (in pairs): 1123, Positive cache size: 1088, Positive conditional cache size: 0, Positive unconditional cache size: 1088, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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.2s, 27 PlacesBefore, 27 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 188, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 51, unknown conditional: 0, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 48, independent conditional: 4, independent unconditional: 44, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 46, 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: 62, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 62, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 62, independent: 46, independent conditional: 0, independent unconditional: 46, 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): 62, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 10, independent unconditional: 35, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 17, dependent conditional: 0, dependent unconditional: 17, 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: 62, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 35, independent conditional: 2, independent unconditional: 33, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 35, independent conditional: 2, independent unconditional: 33, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 35, independent conditional: 2, independent unconditional: 33, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 41 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, independent: 150, independent conditional: 150, 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: 172, independent: 150, independent conditional: 105, independent unconditional: 45, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, independent: 150, independent conditional: 63, independent unconditional: 87, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, independent: 150, independent conditional: 63, independent unconditional: 87, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 9, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, independent: 135, independent conditional: 54, independent unconditional: 81, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 17, unknown conditional: 11, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 61, Positive conditional cache size: 9, Positive unconditional cache size: 52, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 37, independent conditional: 15, independent unconditional: 22, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 37, independent conditional: 11, independent unconditional: 26, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 37, independent conditional: 11, independent unconditional: 26, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 37, independent conditional: 11, independent unconditional: 26, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 61, Positive conditional cache size: 9, Positive unconditional cache size: 52, Negative cache size: 27, Negative conditional cache size: 3, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 46 PlacesBefore, 46 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 45, independent conditional: 27, independent unconditional: 18, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 45, independent conditional: 26, independent unconditional: 19, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 45, independent conditional: 26, independent unconditional: 19, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 53, independent: 38, independent conditional: 19, independent unconditional: 19, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 68, Positive conditional cache size: 16, Positive unconditional cache size: 52, Negative cache size: 27, Negative conditional cache size: 3, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 49 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 58, independent conditional: 36, independent unconditional: 22, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 58, independent conditional: 36, independent unconditional: 22, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 58, independent conditional: 36, independent unconditional: 22, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 56, independent conditional: 34, independent unconditional: 22, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 70, Positive conditional cache size: 18, Positive unconditional cache size: 52, Negative cache size: 27, Negative conditional cache size: 3, Negative unconditional cache size: 24, 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: 14.1s, 48 PlacesBefore, 45 PlacesAfterwards, 34 TransitionsBefore, 31 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 20, independent unconditional: 7, 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: 27, independent: 27, independent conditional: 20, independent unconditional: 7, 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: 7, independent: 7, independent conditional: 5, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 27, independent: 20, independent conditional: 15, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 91, Positive conditional cache size: 24, Positive unconditional cache size: 67, Negative cache size: 27, Negative conditional cache size: 3, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1813; [L851] FCALL, FORK 0 pthread_create(&t1813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1813, ((void *)0), P0, ((void *)0))=-2, t1813={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L852] 0 pthread_t t1814; [L853] FCALL, FORK 0 pthread_create(&t1814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1814, ((void *)0), P1, ((void *)0))=-1, t1813={7:0}, t1814={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] EXPR 1 \read(y) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L771] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L772] EXPR 1 \read(y) [L772] 1 __unbuffered_p0_EAX = y [L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L773] 1 y = y$flush_delayed ? y$mem_tmp : y [L774] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 1 x = 1 [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L854] 0 pthread_t t1815; [L855] FCALL, FORK 0 pthread_create(&t1815, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1815, ((void *)0), P2, ((void *)0))=0, t1813={7:0}, t1814={5:0}, t1815={6:0}, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 2 x = 2 [L792] 2 y = 1 [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 \read(y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=4, weak$$choice1=0, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 y$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(y) [L812] 3 y$mem_tmp = y [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] EXPR 3 \read(y) [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L815] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L816] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L817] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L819] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, 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=2, weak$$choice1=0, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, 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=2, weak$$choice1=0, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, 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=2, weak$$choice1=0, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 y$flush_delayed = weak$$choice2 [L871] EXPR 0 \read(y) [L871] 0 y$mem_tmp = y [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L872] EXPR 0 \read(y) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L872] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L874] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L875] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L876] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L878] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L880] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L880] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L880] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L880] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 x == 2 && y == 2 [L881] EXPR 0 \read(y) [L881] EXPR 0 x == 2 && y == 2 [L881] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L882] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L882] 0 y = y$flush_delayed ? y$mem_tmp : y [L883] 0 y$flush_delayed = (_Bool)0 [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 851]: 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: 855]: 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: 853]: 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, 149 locations, 4 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: 39.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 486 IncrementalHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 3 mSDtfsCounter, 486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=10, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-06 06:35:20,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...