/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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:40:10,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:40:10,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:40:10,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:40:10,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:40:10,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:40:10,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:40:10,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:40:10,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:40:10,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:40:10,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:40:10,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:40:10,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:40:10,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:40:10,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:40:10,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:40:10,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:40:10,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:40:10,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:40:10,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:40:10,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:40:10,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:40:10,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:40:10,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:40:10,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:40:10,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:40:10,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:40:10,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:40:10,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:40:10,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:40:10,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:40:10,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:40:10,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:40:10,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:40:10,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:40:10,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:40:10,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:40:10,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:40:10,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:40:10,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:40:10,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:40:10,849 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:40:10,869 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:40:10,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:40:10,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:40:10,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:40:10,871 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:40:10,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:40:10,871 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:40:10,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:40:10,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:40:10,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:40:10,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:40:10,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:40:10,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:40:10,873 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:40:10,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:40:10,873 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:40:10,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:40:10,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:40:10,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:40:10,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:40:10,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:40:10,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:40:10,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:40:10,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:40:10,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:40:10,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:40:10,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:40:10,874 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:40:10,874 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:40:11,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:40:11,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:40:11,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:40:11,168 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:40:11,168 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:40:11,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:40:12,075 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:40:12,290 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:40:12,291 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:40:12,300 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b360d1b3/8ca64126f4454c94828d5b9c39f89bcd/FLAG10d845939 [2022-12-06 06:40:12,314 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b360d1b3/8ca64126f4454c94828d5b9c39f89bcd [2022-12-06 06:40:12,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:40:12,317 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:40:12,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:40:12,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:40:12,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:40:12,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:40:12" (1/1) ... [2022-12-06 06:40:12,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7129e458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12, skipping insertion in model container [2022-12-06 06:40:12,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:40:12" (1/1) ... [2022-12-06 06:40:12,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:40:12,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:40:12,524 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 06:40:12,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:40:12,707 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:40:12,716 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 06:40:12,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:12,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:12,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:40:12,796 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:40:12,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12 WrapperNode [2022-12-06 06:40:12,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:40:12,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:40:12,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:40:12,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:40:12,802 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:40:12" (1/1) ... [2022-12-06 06:40:12,813 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:40:12" (1/1) ... [2022-12-06 06:40:12,830 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-06 06:40:12,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:40:12,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:40:12,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:40:12,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:40:12,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12" (1/1) ... [2022-12-06 06:40:12,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12" (1/1) ... [2022-12-06 06:40:12,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12" (1/1) ... [2022-12-06 06:40:12,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12" (1/1) ... [2022-12-06 06:40:12,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12" (1/1) ... [2022-12-06 06:40:12,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12" (1/1) ... [2022-12-06 06:40:12,847 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12" (1/1) ... [2022-12-06 06:40:12,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12" (1/1) ... [2022-12-06 06:40:12,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:40:12,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:40:12,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:40:12,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:40:12,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12" (1/1) ... [2022-12-06 06:40:12,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:40:12,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:40:12,882 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:40:12,886 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:40:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:40:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:40:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:40:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:40:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:40:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:40:12,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:40:12,918 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:40:12,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:40:12,918 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:40:12,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:40:12,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:40:12,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:40:12,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:40:12,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:40:12,919 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:40:13,007 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:40:13,009 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:40:13,291 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:40:13,371 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:40:13,372 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:40:13,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:40:13 BoogieIcfgContainer [2022-12-06 06:40:13,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:40:13,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:40:13,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:40:13,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:40:13,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:40:12" (1/3) ... [2022-12-06 06:40:13,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ffaf37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:40:13, skipping insertion in model container [2022-12-06 06:40:13,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:12" (2/3) ... [2022-12-06 06:40:13,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ffaf37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:40:13, skipping insertion in model container [2022-12-06 06:40:13,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:40:13" (3/3) ... [2022-12-06 06:40:13,379 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:40:13,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:40:13,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:40:13,392 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:40:13,440 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:40:13,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2022-12-06 06:40:13,516 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-06 06:40:13,516 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:40:13,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:40:13,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2022-12-06 06:40:13,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2022-12-06 06:40:13,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:13,542 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-06 06:40:13,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2022-12-06 06:40:13,582 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-06 06:40:13,583 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:40:13,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:40:13,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-06 06:40:13,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 1818 [2022-12-06 06:40:17,992 INFO L203 LiptonReduction]: Total number of compositions: 80 [2022-12-06 06:40:18,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:40:18,008 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;@122d862c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:40:18,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:40:18,010 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-06 06:40:18,010 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:40:18,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:18,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:40:18,011 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:18,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:18,015 INFO L85 PathProgramCache]: Analyzing trace with hash 464649, now seen corresponding path program 1 times [2022-12-06 06:40:18,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:18,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61940149] [2022-12-06 06:40:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:18,360 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:40:18,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:18,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61940149] [2022-12-06 06:40:18,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61940149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:18,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:18,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:40:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836965371] [2022-12-06 06:40:18,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:18,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:40:18,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:40:18,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:40:18,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 06:40:18,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:40:18,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:18,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 06:40:18,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:18,655 INFO L130 PetriNetUnfolder]: 882/1394 cut-off events. [2022-12-06 06:40:18,655 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 06:40:18,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2768 conditions, 1394 events. 882/1394 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6629 event pairs, 234 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 2757. Up to 1078 conditions per place. [2022-12-06 06:40:18,667 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 29 selfloop transitions, 2 changer transitions 8/41 dead transitions. [2022-12-06 06:40:18,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 175 flow [2022-12-06 06:40:18,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:40:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:40:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:40:18,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-06 06:40:18,679 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:40:18,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 175 flow [2022-12-06 06:40:18,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:40:18,682 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 50 flow [2022-12-06 06:40:18,684 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2022-12-06 06:40:18,687 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 06:40:18,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:18,713 INFO L89 Accepts]: Start accepts. Operand has 33 places, 20 transitions, 50 flow [2022-12-06 06:40:18,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:18,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:18,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 20 transitions, 50 flow [2022-12-06 06:40:18,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 06:40:18,721 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:40:18,721 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:40:18,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 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 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:40:18,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 06:40:18,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 06:40:18,822 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:18,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-06 06:40:18,824 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-06 06:40:18,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:40:18,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:18,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:18,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:40:18,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:18,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1017722405, now seen corresponding path program 1 times [2022-12-06 06:40:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:18,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530895273] [2022-12-06 06:40:18,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:18,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:19,794 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:40:19,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:19,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530895273] [2022-12-06 06:40:19,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530895273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:19,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:19,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:40:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868441073] [2022-12-06 06:40:19,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:19,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:40:19,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:19,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:40:19,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:40:19,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:40:19,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:40:19,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:19,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:40:19,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:20,006 INFO L130 PetriNetUnfolder]: 1042/1562 cut-off events. [2022-12-06 06:40:20,007 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:40:20,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 1562 events. 1042/1562 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6881 event pairs, 166 based on Foata normal form. 30/1592 useless extension candidates. Maximal degree in co-relation 3261. Up to 1323 conditions per place. [2022-12-06 06:40:20,015 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 37 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2022-12-06 06:40:20,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 208 flow [2022-12-06 06:40:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:40:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:40:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 06:40:20,016 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6125 [2022-12-06 06:40:20,016 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 4 states and 49 transitions. [2022-12-06 06:40:20,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 208 flow [2022-12-06 06:40:20,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:40:20,018 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 109 flow [2022-12-06 06:40:20,018 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-06 06:40:20,019 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2022-12-06 06:40:20,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:20,019 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 109 flow [2022-12-06 06:40:20,019 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:20,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:20,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 109 flow [2022-12-06 06:40:20,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 109 flow [2022-12-06 06:40:20,045 INFO L130 PetriNetUnfolder]: 148/293 cut-off events. [2022-12-06 06:40:20,045 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-06 06:40:20,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 293 events. 148/293 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1385 event pairs, 77 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 633. Up to 212 conditions per place. [2022-12-06 06:40:20,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 28 transitions, 109 flow [2022-12-06 06:40:20,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 06:40:20,062 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:20,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 06:40:20,063 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 109 flow [2022-12-06 06:40:20,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:40:20,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:20,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:20,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:40:20,064 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1484622426, now seen corresponding path program 1 times [2022-12-06 06:40:20,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:20,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165836431] [2022-12-06 06:40:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:20,204 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:40:20,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:20,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165836431] [2022-12-06 06:40:20,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165836431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:20,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:20,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:40:20,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311550197] [2022-12-06 06:40:20,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:20,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:40:20,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:20,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:40:20,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:40:20,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:40:20,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:40:20,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:20,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:40:20,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:20,351 INFO L130 PetriNetUnfolder]: 722/1162 cut-off events. [2022-12-06 06:40:20,352 INFO L131 PetriNetUnfolder]: For 468/493 co-relation queries the response was YES. [2022-12-06 06:40:20,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 1162 events. 722/1162 cut-off events. For 468/493 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5293 event pairs, 143 based on Foata normal form. 42/1200 useless extension candidates. Maximal degree in co-relation 3171. Up to 809 conditions per place. [2022-12-06 06:40:20,366 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 35 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-12-06 06:40:20,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 234 flow [2022-12-06 06:40:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:40:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:40:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 06:40:20,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:40:20,369 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 109 flow. Second operand 3 states and 33 transitions. [2022-12-06 06:40:20,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 234 flow [2022-12-06 06:40:20,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:40:20,372 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 120 flow [2022-12-06 06:40:20,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-06 06:40:20,373 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2022-12-06 06:40:20,373 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:20,373 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 120 flow [2022-12-06 06:40:20,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:20,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:20,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 120 flow [2022-12-06 06:40:20,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 120 flow [2022-12-06 06:40:20,399 INFO L130 PetriNetUnfolder]: 129/257 cut-off events. [2022-12-06 06:40:20,399 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-06 06:40:20,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 257 events. 129/257 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1175 event pairs, 55 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 609. Up to 183 conditions per place. [2022-12-06 06:40:20,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 120 flow [2022-12-06 06:40:20,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 06:40:20,410 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:20,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 06:40:20,411 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 120 flow [2022-12-06 06:40:20,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:40:20,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:20,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:20,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:40:20,411 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1616292775, now seen corresponding path program 1 times [2022-12-06 06:40:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:20,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937735160] [2022-12-06 06:40:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:20,842 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:40:20,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:20,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937735160] [2022-12-06 06:40:20,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937735160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:20,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:20,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:40:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071065792] [2022-12-06 06:40:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:20,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:40:20,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:20,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:40:20,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:40:20,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:40:20,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:40:20,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:20,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:40:20,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:20,998 INFO L130 PetriNetUnfolder]: 882/1369 cut-off events. [2022-12-06 06:40:20,999 INFO L131 PetriNetUnfolder]: For 844/844 co-relation queries the response was YES. [2022-12-06 06:40:21,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4008 conditions, 1369 events. 882/1369 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6043 event pairs, 180 based on Foata normal form. 12/1381 useless extension candidates. Maximal degree in co-relation 3993. Up to 1137 conditions per place. [2022-12-06 06:40:21,007 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 37 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-12-06 06:40:21,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 242 flow [2022-12-06 06:40:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:40:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:40:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 06:40:21,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:40:21,009 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 120 flow. Second operand 3 states and 36 transitions. [2022-12-06 06:40:21,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 242 flow [2022-12-06 06:40:21,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:40:21,012 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 122 flow [2022-12-06 06:40:21,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-06 06:40:21,013 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-06 06:40:21,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:21,013 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 122 flow [2022-12-06 06:40:21,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:21,014 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:21,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 122 flow [2022-12-06 06:40:21,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 122 flow [2022-12-06 06:40:21,036 INFO L130 PetriNetUnfolder]: 129/257 cut-off events. [2022-12-06 06:40:21,037 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-06 06:40:21,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 257 events. 129/257 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1172 event pairs, 55 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 608. Up to 183 conditions per place. [2022-12-06 06:40:21,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 122 flow [2022-12-06 06:40:21,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 06:40:21,046 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:21,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 06:40:21,048 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 122 flow [2022-12-06 06:40:21,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:40:21,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:21,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:21,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:40:21,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:21,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1262520475, now seen corresponding path program 1 times [2022-12-06 06:40:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:21,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790711323] [2022-12-06 06:40:21,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:21,685 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:40:21,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:21,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790711323] [2022-12-06 06:40:21,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790711323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:21,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:21,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:40:21,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562149694] [2022-12-06 06:40:21,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:21,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:40:21,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:21,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:40:21,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:40:21,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:40:21,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 122 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:40:21,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:21,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:40:21,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:21,915 INFO L130 PetriNetUnfolder]: 1226/1884 cut-off events. [2022-12-06 06:40:21,916 INFO L131 PetriNetUnfolder]: For 1086/1086 co-relation queries the response was YES. [2022-12-06 06:40:21,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5453 conditions, 1884 events. 1226/1884 cut-off events. For 1086/1086 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8713 event pairs, 317 based on Foata normal form. 48/1932 useless extension candidates. Maximal degree in co-relation 5437. Up to 988 conditions per place. [2022-12-06 06:40:21,926 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 42 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2022-12-06 06:40:21,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 300 flow [2022-12-06 06:40:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:40:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:40:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 06:40:21,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 06:40:21,929 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 122 flow. Second operand 4 states and 45 transitions. [2022-12-06 06:40:21,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 300 flow [2022-12-06 06:40:21,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 51 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:40:21,933 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 172 flow [2022-12-06 06:40:21,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-06 06:40:21,938 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-06 06:40:21,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:21,938 INFO L89 Accepts]: Start accepts. Operand has 39 places, 32 transitions, 172 flow [2022-12-06 06:40:21,939 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:21,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:21,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 172 flow [2022-12-06 06:40:21,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 172 flow [2022-12-06 06:40:21,973 INFO L130 PetriNetUnfolder]: 181/396 cut-off events. [2022-12-06 06:40:21,973 INFO L131 PetriNetUnfolder]: For 324/352 co-relation queries the response was YES. [2022-12-06 06:40:21,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 396 events. 181/396 cut-off events. For 324/352 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2199 event pairs, 104 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 1022. Up to 265 conditions per place. [2022-12-06 06:40:21,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 172 flow [2022-12-06 06:40:21,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 06:40:21,980 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:21,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 06:40:21,983 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 172 flow [2022-12-06 06:40:21,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:40:21,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:21,983 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:21,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:40:21,983 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:21,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash 985962938, now seen corresponding path program 1 times [2022-12-06 06:40:21,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:21,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054801794] [2022-12-06 06:40:21,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:22,330 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:40:22,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:22,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054801794] [2022-12-06 06:40:22,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054801794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:22,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:22,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:40:22,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707208312] [2022-12-06 06:40:22,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:22,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:40:22,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:22,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:40:22,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:40:22,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:40:22,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:40:22,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:22,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:40:22,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:22,657 INFO L130 PetriNetUnfolder]: 1279/1973 cut-off events. [2022-12-06 06:40:22,657 INFO L131 PetriNetUnfolder]: For 2098/2138 co-relation queries the response was YES. [2022-12-06 06:40:22,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6306 conditions, 1973 events. 1279/1973 cut-off events. For 2098/2138 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9203 event pairs, 351 based on Foata normal form. 48/2021 useless extension candidates. Maximal degree in co-relation 6288. Up to 1604 conditions per place. [2022-12-06 06:40:22,667 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 57 selfloop transitions, 14 changer transitions 3/76 dead transitions. [2022-12-06 06:40:22,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 518 flow [2022-12-06 06:40:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:40:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:40:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 06:40:22,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-12-06 06:40:22,670 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 172 flow. Second operand 5 states and 58 transitions. [2022-12-06 06:40:22,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 518 flow [2022-12-06 06:40:22,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 76 transitions, 501 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 06:40:22,676 INFO L231 Difference]: Finished difference. Result has 44 places, 44 transitions, 274 flow [2022-12-06 06:40:22,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=44, PETRI_TRANSITIONS=44} [2022-12-06 06:40:22,678 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-06 06:40:22,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:22,678 INFO L89 Accepts]: Start accepts. Operand has 44 places, 44 transitions, 274 flow [2022-12-06 06:40:22,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:22,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:22,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 44 transitions, 274 flow [2022-12-06 06:40:22,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 44 transitions, 274 flow [2022-12-06 06:40:22,727 INFO L130 PetriNetUnfolder]: 277/547 cut-off events. [2022-12-06 06:40:22,727 INFO L131 PetriNetUnfolder]: For 663/695 co-relation queries the response was YES. [2022-12-06 06:40:22,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 547 events. 277/547 cut-off events. For 663/695 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3002 event pairs, 86 based on Foata normal form. 16/547 useless extension candidates. Maximal degree in co-relation 1830. Up to 367 conditions per place. [2022-12-06 06:40:22,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 44 transitions, 274 flow [2022-12-06 06:40:22,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-06 06:40:22,736 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:22,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 06:40:22,737 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 274 flow [2022-12-06 06:40:22,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:40:22,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:22,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:22,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:40:22,737 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:22,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:22,738 INFO L85 PathProgramCache]: Analyzing trace with hash 500077213, now seen corresponding path program 1 times [2022-12-06 06:40:22,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:22,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5594011] [2022-12-06 06:40:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:23,255 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:40:23,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:23,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5594011] [2022-12-06 06:40:23,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5594011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:23,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:23,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:40:23,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672733859] [2022-12-06 06:40:23,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:23,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:40:23,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:23,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:40:23,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:40:23,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:40:23,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:23,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:23,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:40:23,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:23,575 INFO L130 PetriNetUnfolder]: 1285/1987 cut-off events. [2022-12-06 06:40:23,575 INFO L131 PetriNetUnfolder]: For 3460/3497 co-relation queries the response was YES. [2022-12-06 06:40:23,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7490 conditions, 1987 events. 1285/1987 cut-off events. For 3460/3497 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9294 event pairs, 326 based on Foata normal form. 45/2032 useless extension candidates. Maximal degree in co-relation 7469. Up to 1460 conditions per place. [2022-12-06 06:40:23,588 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 59 selfloop transitions, 17 changer transitions 3/81 dead transitions. [2022-12-06 06:40:23,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 81 transitions, 615 flow [2022-12-06 06:40:23,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:40:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:40:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 06:40:23,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-12-06 06:40:23,590 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 274 flow. Second operand 5 states and 58 transitions. [2022-12-06 06:40:23,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 81 transitions, 615 flow [2022-12-06 06:40:23,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:40:23,595 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 373 flow [2022-12-06 06:40:23,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2022-12-06 06:40:23,596 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2022-12-06 06:40:23,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:23,596 INFO L89 Accepts]: Start accepts. Operand has 50 places, 49 transitions, 373 flow [2022-12-06 06:40:23,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:23,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:23,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 49 transitions, 373 flow [2022-12-06 06:40:23,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 49 transitions, 373 flow [2022-12-06 06:40:23,647 INFO L130 PetriNetUnfolder]: 280/551 cut-off events. [2022-12-06 06:40:23,648 INFO L131 PetriNetUnfolder]: For 1289/1329 co-relation queries the response was YES. [2022-12-06 06:40:23,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2258 conditions, 551 events. 280/551 cut-off events. For 1289/1329 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2983 event pairs, 96 based on Foata normal form. 22/560 useless extension candidates. Maximal degree in co-relation 2236. Up to 370 conditions per place. [2022-12-06 06:40:23,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 49 transitions, 373 flow [2022-12-06 06:40:23,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 06:40:23,656 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:23,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 06:40:23,657 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 373 flow [2022-12-06 06:40:23,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:23,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:23,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:23,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:40:23,657 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash 841025935, now seen corresponding path program 1 times [2022-12-06 06:40:23,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:23,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049258454] [2022-12-06 06:40:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:23,910 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:40:23,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:23,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049258454] [2022-12-06 06:40:23,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049258454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:23,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:23,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:40:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639264533] [2022-12-06 06:40:23,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:23,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:40:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:40:23,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:40:23,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:40:23,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:23,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:23,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:40:23,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:24,227 INFO L130 PetriNetUnfolder]: 1295/2018 cut-off events. [2022-12-06 06:40:24,228 INFO L131 PetriNetUnfolder]: For 5367/5404 co-relation queries the response was YES. [2022-12-06 06:40:24,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8649 conditions, 2018 events. 1295/2018 cut-off events. For 5367/5404 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9531 event pairs, 561 based on Foata normal form. 41/2059 useless extension candidates. Maximal degree in co-relation 8624. Up to 1737 conditions per place. [2022-12-06 06:40:24,246 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 61 selfloop transitions, 18 changer transitions 1/82 dead transitions. [2022-12-06 06:40:24,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 732 flow [2022-12-06 06:40:24,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:40:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:40:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 06:40:24,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 06:40:24,247 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 373 flow. Second operand 5 states and 52 transitions. [2022-12-06 06:40:24,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 732 flow [2022-12-06 06:40:24,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:40:24,254 INFO L231 Difference]: Finished difference. Result has 55 places, 60 transitions, 531 flow [2022-12-06 06:40:24,254 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=531, PETRI_PLACES=55, PETRI_TRANSITIONS=60} [2022-12-06 06:40:24,255 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-06 06:40:24,255 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:24,255 INFO L89 Accepts]: Start accepts. Operand has 55 places, 60 transitions, 531 flow [2022-12-06 06:40:24,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:24,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:24,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 60 transitions, 531 flow [2022-12-06 06:40:24,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 60 transitions, 531 flow [2022-12-06 06:40:24,324 INFO L130 PetriNetUnfolder]: 299/584 cut-off events. [2022-12-06 06:40:24,324 INFO L131 PetriNetUnfolder]: For 1955/2005 co-relation queries the response was YES. [2022-12-06 06:40:24,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2810 conditions, 584 events. 299/584 cut-off events. For 1955/2005 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3208 event pairs, 83 based on Foata normal form. 20/591 useless extension candidates. Maximal degree in co-relation 2785. Up to 392 conditions per place. [2022-12-06 06:40:24,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 60 transitions, 531 flow [2022-12-06 06:40:24,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 06:40:25,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L786-->L789: Formula: (= v_~y~0_5 1) InVars {} OutVars{~y~0=v_~y~0_5} AuxVars[] AssignedVars[~y~0] and [425] $Ultimate##0-->L749: Formula: (and (= v_~y$w_buff0_used~0_204 v_~y$w_buff1_used~0_190) (= 2 v_~y$w_buff0~0_111) (= |v_P0Thread1of1ForFork2_~arg#1.offset_7| |v_P0Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_112) (= v_~y$r_buff0_thd1~0_59 v_~y$r_buff1_thd1~0_45) (= v_~y$r_buff0_thd1~0_58 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_39) (= |v_P0Thread1of1ForFork2_~arg#1.base_7| |v_P0Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~y$w_buff0_used~0_203 1) (= v_~y$r_buff0_thd0~0_103 v_~y$r_buff1_thd0~0_103) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_203 256) 0)) (not (= (mod v_~y$w_buff1_used~0_190 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_204, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_103, ~y$w_buff0~0=v_~y$w_buff0~0_112, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_7|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_45, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_103, ~y$w_buff0~0=v_~y$w_buff0~0_111, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_103, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_190} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:40:25,330 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L786-->L789: Formula: (= v_~y~0_5 1) InVars {} OutVars{~y~0=v_~y~0_5} AuxVars[] AssignedVars[~y~0] and [327] L769-->L776: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_102 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_27 (ite .cse3 0 v_~y$r_buff0_thd2~0_28)) (= v_~y~0_63 (ite .cse2 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_34 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:40:25,384 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L786-->L789: Formula: (= v_~y~0_5 1) InVars {} OutVars{~y~0=v_~y~0_5} AuxVars[] AssignedVars[~y~0] and [216] L823-->L829: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_121 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd0~0_52 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_56 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_122 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse2)) (.cse0 (and .cse1 .cse5))) (and (= v_~y$r_buff0_thd0~0_55 (ite .cse0 0 v_~y$r_buff0_thd0~0_56)) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse2)) 0 v_~y$r_buff1_thd0~0_52) v_~y$r_buff1_thd0~0_51) (= v_~y$w_buff0_used~0_121 (ite .cse3 0 v_~y$w_buff0_used~0_122)) (= (ite .cse3 v_~y$w_buff0~0_55 (ite .cse4 v_~y$w_buff1~0_46 v_~y~0_82)) v_~y~0_81) (= v_~y$w_buff1_used~0_118 (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_119))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_122, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_55, ~y~0=v_~y~0_82, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_121, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_55, ~y~0=v_~y~0_81, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:40:25,443 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:40:25,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1189 [2022-12-06 06:40:25,444 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 59 transitions, 557 flow [2022-12-06 06:40:25,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:25,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:25,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:25,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:40:25,445 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:25,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash -101910830, now seen corresponding path program 1 times [2022-12-06 06:40:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:25,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851513193] [2022-12-06 06:40:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:25,744 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:40:25,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:25,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851513193] [2022-12-06 06:40:25,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851513193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:25,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:25,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:40:25,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564394286] [2022-12-06 06:40:25,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:25,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:40:25,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:25,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:40:25,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:40:25,746 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 06:40:25,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 557 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:40:25,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:25,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 06:40:25,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:25,997 INFO L130 PetriNetUnfolder]: 1267/1974 cut-off events. [2022-12-06 06:40:25,997 INFO L131 PetriNetUnfolder]: For 7915/7952 co-relation queries the response was YES. [2022-12-06 06:40:26,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9498 conditions, 1974 events. 1267/1974 cut-off events. For 7915/7952 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9456 event pairs, 437 based on Foata normal form. 41/2015 useless extension candidates. Maximal degree in co-relation 9470. Up to 1715 conditions per place. [2022-12-06 06:40:26,018 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 61 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2022-12-06 06:40:26,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 780 flow [2022-12-06 06:40:26,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:40:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:40:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 06:40:26,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47 [2022-12-06 06:40:26,020 INFO L175 Difference]: Start difference. First operand has 54 places, 59 transitions, 557 flow. Second operand 4 states and 47 transitions. [2022-12-06 06:40:26,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 780 flow [2022-12-06 06:40:26,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 736 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-06 06:40:26,034 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 514 flow [2022-12-06 06:40:26,034 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=514, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2022-12-06 06:40:26,035 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-12-06 06:40:26,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:26,035 INFO L89 Accepts]: Start accepts. Operand has 56 places, 58 transitions, 514 flow [2022-12-06 06:40:26,036 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:26,036 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:26,036 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 58 transitions, 514 flow [2022-12-06 06:40:26,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 58 transitions, 514 flow [2022-12-06 06:40:26,107 INFO L130 PetriNetUnfolder]: 295/574 cut-off events. [2022-12-06 06:40:26,107 INFO L131 PetriNetUnfolder]: For 2051/2117 co-relation queries the response was YES. [2022-12-06 06:40:26,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 574 events. 295/574 cut-off events. For 2051/2117 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3127 event pairs, 100 based on Foata normal form. 20/583 useless extension candidates. Maximal degree in co-relation 2671. Up to 386 conditions per place. [2022-12-06 06:40:26,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 58 transitions, 514 flow [2022-12-06 06:40:26,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 326 [2022-12-06 06:40:26,119 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:26,119 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 06:40:26,120 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 514 flow [2022-12-06 06:40:26,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:40:26,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:26,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:26,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:40:26,120 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1135733361, now seen corresponding path program 1 times [2022-12-06 06:40:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:26,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228999254] [2022-12-06 06:40:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:26,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:26,420 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:40:26,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:26,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228999254] [2022-12-06 06:40:26,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228999254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:26,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:26,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:40:26,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531176454] [2022-12-06 06:40:26,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:26,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:40:26,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:26,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:40:26,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:40:26,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:40:26,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 514 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:40:26,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:26,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:40:26,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:26,753 INFO L130 PetriNetUnfolder]: 1363/2132 cut-off events. [2022-12-06 06:40:26,753 INFO L131 PetriNetUnfolder]: For 9321/9363 co-relation queries the response was YES. [2022-12-06 06:40:26,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10112 conditions, 2132 events. 1363/2132 cut-off events. For 9321/9363 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10672 event pairs, 232 based on Foata normal form. 54/2186 useless extension candidates. Maximal degree in co-relation 10083. Up to 1520 conditions per place. [2022-12-06 06:40:26,769 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 64 selfloop transitions, 33 changer transitions 5/104 dead transitions. [2022-12-06 06:40:26,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 104 transitions, 1035 flow [2022-12-06 06:40:26,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:40:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:40:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 06:40:26,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 06:40:26,771 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 514 flow. Second operand 5 states and 68 transitions. [2022-12-06 06:40:26,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 104 transitions, 1035 flow [2022-12-06 06:40:26,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 104 transitions, 996 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:40:26,780 INFO L231 Difference]: Finished difference. Result has 58 places, 69 transitions, 725 flow [2022-12-06 06:40:26,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=725, PETRI_PLACES=58, PETRI_TRANSITIONS=69} [2022-12-06 06:40:26,781 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-12-06 06:40:26,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:26,782 INFO L89 Accepts]: Start accepts. Operand has 58 places, 69 transitions, 725 flow [2022-12-06 06:40:26,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:26,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:26,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 69 transitions, 725 flow [2022-12-06 06:40:26,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 69 transitions, 725 flow [2022-12-06 06:40:26,845 INFO L130 PetriNetUnfolder]: 303/599 cut-off events. [2022-12-06 06:40:26,845 INFO L131 PetriNetUnfolder]: For 2632/2718 co-relation queries the response was YES. [2022-12-06 06:40:26,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3175 conditions, 599 events. 303/599 cut-off events. For 2632/2718 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3402 event pairs, 80 based on Foata normal form. 20/608 useless extension candidates. Maximal degree in co-relation 3148. Up to 400 conditions per place. [2022-12-06 06:40:26,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 69 transitions, 725 flow [2022-12-06 06:40:26,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 06:40:26,859 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:26,860 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 06:40:26,860 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 69 transitions, 725 flow [2022-12-06 06:40:26,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:40:26,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:26,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:26,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:40:26,861 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:26,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash 841130746, now seen corresponding path program 1 times [2022-12-06 06:40:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:26,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16216735] [2022-12-06 06:40:26,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:26,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:27,303 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:40:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16216735] [2022-12-06 06:40:27,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16216735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:27,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:27,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:40:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294878555] [2022-12-06 06:40:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:27,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:40:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:27,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:40:27,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:40:27,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:40:27,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 69 transitions, 725 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:27,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:27,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:40:27,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:27,630 INFO L130 PetriNetUnfolder]: 1372/2161 cut-off events. [2022-12-06 06:40:27,631 INFO L131 PetriNetUnfolder]: For 11069/11117 co-relation queries the response was YES. [2022-12-06 06:40:27,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11090 conditions, 2161 events. 1372/2161 cut-off events. For 11069/11117 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10982 event pairs, 206 based on Foata normal form. 56/2217 useless extension candidates. Maximal degree in co-relation 11060. Up to 1369 conditions per place. [2022-12-06 06:40:27,644 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 59 selfloop transitions, 21 changer transitions 13/95 dead transitions. [2022-12-06 06:40:27,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 1055 flow [2022-12-06 06:40:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:40:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:40:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 06:40:27,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 06:40:27,646 INFO L175 Difference]: Start difference. First operand has 58 places, 69 transitions, 725 flow. Second operand 4 states and 54 transitions. [2022-12-06 06:40:27,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 1055 flow [2022-12-06 06:40:27,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 1053 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 06:40:27,657 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 713 flow [2022-12-06 06:40:27,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=713, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2022-12-06 06:40:27,657 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2022-12-06 06:40:27,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:27,658 INFO L89 Accepts]: Start accepts. Operand has 62 places, 64 transitions, 713 flow [2022-12-06 06:40:27,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:27,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:27,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 64 transitions, 713 flow [2022-12-06 06:40:27,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 64 transitions, 713 flow [2022-12-06 06:40:27,711 INFO L130 PetriNetUnfolder]: 242/486 cut-off events. [2022-12-06 06:40:27,711 INFO L131 PetriNetUnfolder]: For 2728/2771 co-relation queries the response was YES. [2022-12-06 06:40:27,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2765 conditions, 486 events. 242/486 cut-off events. For 2728/2771 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2602 event pairs, 70 based on Foata normal form. 15/491 useless extension candidates. Maximal degree in co-relation 2735. Up to 324 conditions per place. [2022-12-06 06:40:27,716 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 64 transitions, 713 flow [2022-12-06 06:40:27,716 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 06:40:28,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:40:28,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 749 [2022-12-06 06:40:28,407 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 740 flow [2022-12-06 06:40:28,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:28,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:28,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:28,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:40:28,407 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash 841130529, now seen corresponding path program 1 times [2022-12-06 06:40:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:28,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496195668] [2022-12-06 06:40:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:28,784 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:40:28,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:28,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496195668] [2022-12-06 06:40:28,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496195668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:28,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:28,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:40:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587251059] [2022-12-06 06:40:28,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:28,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:40:28,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:28,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:40:28,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:40:28,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:40:28,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:28,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:28,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:40:28,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:29,074 INFO L130 PetriNetUnfolder]: 1147/1832 cut-off events. [2022-12-06 06:40:29,074 INFO L131 PetriNetUnfolder]: For 11162/11196 co-relation queries the response was YES. [2022-12-06 06:40:29,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9718 conditions, 1832 events. 1147/1832 cut-off events. For 11162/11196 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9076 event pairs, 443 based on Foata normal form. 38/1870 useless extension candidates. Maximal degree in co-relation 9685. Up to 1671 conditions per place. [2022-12-06 06:40:29,097 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 64 selfloop transitions, 13 changer transitions 4/83 dead transitions. [2022-12-06 06:40:29,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 1006 flow [2022-12-06 06:40:29,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:40:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:40:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 06:40:29,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 06:40:29,099 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 740 flow. Second operand 4 states and 44 transitions. [2022-12-06 06:40:29,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 1006 flow [2022-12-06 06:40:29,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 967 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 06:40:29,110 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 751 flow [2022-12-06 06:40:29,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=751, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2022-12-06 06:40:29,111 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2022-12-06 06:40:29,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:29,111 INFO L89 Accepts]: Start accepts. Operand has 64 places, 66 transitions, 751 flow [2022-12-06 06:40:29,113 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:29,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:29,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 66 transitions, 751 flow [2022-12-06 06:40:29,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 66 transitions, 751 flow [2022-12-06 06:40:29,156 INFO L130 PetriNetUnfolder]: 233/479 cut-off events. [2022-12-06 06:40:29,157 INFO L131 PetriNetUnfolder]: For 2759/2802 co-relation queries the response was YES. [2022-12-06 06:40:29,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 479 events. 233/479 cut-off events. For 2759/2802 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2619 event pairs, 68 based on Foata normal form. 15/484 useless extension candidates. Maximal degree in co-relation 2699. Up to 315 conditions per place. [2022-12-06 06:40:29,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 66 transitions, 751 flow [2022-12-06 06:40:29,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 06:40:29,165 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:29,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 06:40:29,167 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 751 flow [2022-12-06 06:40:29,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:29,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:29,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:29,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:40:29,168 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:29,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:29,168 INFO L85 PathProgramCache]: Analyzing trace with hash 847835829, now seen corresponding path program 2 times [2022-12-06 06:40:29,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:29,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973295866] [2022-12-06 06:40:29,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:29,611 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:40:29,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:29,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973295866] [2022-12-06 06:40:29,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973295866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:29,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:29,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:40:29,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12838351] [2022-12-06 06:40:29,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:29,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:40:29,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:29,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:40:29,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:40:29,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 06:40:29,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 751 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:29,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:29,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 06:40:29,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:29,914 INFO L130 PetriNetUnfolder]: 1042/1649 cut-off events. [2022-12-06 06:40:29,914 INFO L131 PetriNetUnfolder]: For 10231/10264 co-relation queries the response was YES. [2022-12-06 06:40:29,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8783 conditions, 1649 events. 1042/1649 cut-off events. For 10231/10264 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7832 event pairs, 399 based on Foata normal form. 37/1686 useless extension candidates. Maximal degree in co-relation 8750. Up to 1477 conditions per place. [2022-12-06 06:40:29,923 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 63 selfloop transitions, 23 changer transitions 2/90 dead transitions. [2022-12-06 06:40:29,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 1114 flow [2022-12-06 06:40:29,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:40:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:40:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-12-06 06:40:29,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2022-12-06 06:40:29,925 INFO L175 Difference]: Start difference. First operand has 63 places, 66 transitions, 751 flow. Second operand 7 states and 56 transitions. [2022-12-06 06:40:29,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 1114 flow [2022-12-06 06:40:29,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 1084 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 06:40:29,938 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 862 flow [2022-12-06 06:40:29,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=862, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2022-12-06 06:40:29,939 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2022-12-06 06:40:29,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:29,940 INFO L89 Accepts]: Start accepts. Operand has 69 places, 70 transitions, 862 flow [2022-12-06 06:40:29,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:29,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:29,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 70 transitions, 862 flow [2022-12-06 06:40:29,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 70 transitions, 862 flow [2022-12-06 06:40:29,981 INFO L130 PetriNetUnfolder]: 226/465 cut-off events. [2022-12-06 06:40:29,982 INFO L131 PetriNetUnfolder]: For 3005/3044 co-relation queries the response was YES. [2022-12-06 06:40:29,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2715 conditions, 465 events. 226/465 cut-off events. For 3005/3044 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2554 event pairs, 68 based on Foata normal form. 11/466 useless extension candidates. Maximal degree in co-relation 2683. Up to 304 conditions per place. [2022-12-06 06:40:29,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 70 transitions, 862 flow [2022-12-06 06:40:29,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 06:40:29,992 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:29,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 06:40:29,994 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 862 flow [2022-12-06 06:40:29,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:29,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:29,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:29,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:40:29,994 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:29,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash 783761019, now seen corresponding path program 1 times [2022-12-06 06:40:29,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:29,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404494425] [2022-12-06 06:40:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:29,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:30,091 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:40:30,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:30,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404494425] [2022-12-06 06:40:30,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404494425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:30,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:30,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:40:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426454016] [2022-12-06 06:40:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:30,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:40:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:40:30,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:40:30,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 06:40:30,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 862 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:40:30,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:30,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 06:40:30,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:30,215 INFO L130 PetriNetUnfolder]: 535/942 cut-off events. [2022-12-06 06:40:30,216 INFO L131 PetriNetUnfolder]: For 7675/7731 co-relation queries the response was YES. [2022-12-06 06:40:30,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5085 conditions, 942 events. 535/942 cut-off events. For 7675/7731 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4536 event pairs, 95 based on Foata normal form. 98/1038 useless extension candidates. Maximal degree in co-relation 5050. Up to 715 conditions per place. [2022-12-06 06:40:30,221 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 78 selfloop transitions, 4 changer transitions 2/89 dead transitions. [2022-12-06 06:40:30,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 1165 flow [2022-12-06 06:40:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:40:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:40:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 06:40:30,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5797101449275363 [2022-12-06 06:40:30,223 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 862 flow. Second operand 3 states and 40 transitions. [2022-12-06 06:40:30,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 1165 flow [2022-12-06 06:40:30,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 1077 flow, removed 24 selfloop flow, removed 7 redundant places. [2022-12-06 06:40:30,238 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 669 flow [2022-12-06 06:40:30,238 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2022-12-06 06:40:30,239 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2022-12-06 06:40:30,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:30,239 INFO L89 Accepts]: Start accepts. Operand has 64 places, 64 transitions, 669 flow [2022-12-06 06:40:30,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:30,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:30,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 64 transitions, 669 flow [2022-12-06 06:40:30,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 64 transitions, 669 flow [2022-12-06 06:40:30,291 INFO L130 PetriNetUnfolder]: 243/547 cut-off events. [2022-12-06 06:40:30,291 INFO L131 PetriNetUnfolder]: For 2943/3005 co-relation queries the response was YES. [2022-12-06 06:40:30,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 547 events. 243/547 cut-off events. For 2943/3005 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3275 event pairs, 82 based on Foata normal form. 10/529 useless extension candidates. Maximal degree in co-relation 2621. Up to 286 conditions per place. [2022-12-06 06:40:30,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 64 transitions, 669 flow [2022-12-06 06:40:30,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 06:40:30,297 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [327] L769-->L776: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_102 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_27 (ite .cse3 0 v_~y$r_buff0_thd2~0_28)) (= v_~y~0_63 (ite .cse2 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_34 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [334] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse4 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_23 256) 0)) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_82 256) 0)))) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_83) v_~y$w_buff1_used~0_82) (= v_~y$r_buff0_thd3~0_23 (ite .cse4 0 v_~y$r_buff0_thd3~0_24)) (= v_~y~0_47 (ite .cse0 v_~y$w_buff0~0_31 (ite .cse3 v_~y$w_buff1~0_24 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_31, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~y$w_buff0~0=v_~y$w_buff0~0_31, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:40:30,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [327] L769-->L776: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_102 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_27 (ite .cse3 0 v_~y$r_buff0_thd2~0_28)) (= v_~y~0_63 (ite .cse2 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_34 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [321] L752-->L759: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_95 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_29 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_96 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4))) (and (= (ite .cse0 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_30 v_~y~0_56)) v_~y~0_55) (= v_~y$r_buff0_thd1~0_28 (ite .cse2 0 v_~y$r_buff0_thd1~0_29)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd1~0_28 256) 0)) .cse4)) 0 v_~y$r_buff1_thd1~0_20) v_~y$r_buff1_thd1~0_19) (= (ite .cse0 0 v_~y$w_buff0_used~0_96) v_~y$w_buff0_used~0_95) (= v_~y$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_95))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y~0=v_~y~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_28, ~y~0=v_~y~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:40:30,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L786-->L789: Formula: (= v_~y~0_5 1) InVars {} OutVars{~y~0=v_~y~0_5} AuxVars[] AssignedVars[~y~0] and [321] L752-->L759: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_95 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_29 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_96 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4))) (and (= (ite .cse0 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_30 v_~y~0_56)) v_~y~0_55) (= v_~y$r_buff0_thd1~0_28 (ite .cse2 0 v_~y$r_buff0_thd1~0_29)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd1~0_28 256) 0)) .cse4)) 0 v_~y$r_buff1_thd1~0_20) v_~y$r_buff1_thd1~0_19) (= (ite .cse0 0 v_~y$w_buff0_used~0_96) v_~y$w_buff0_used~0_95) (= v_~y$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_95))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y~0=v_~y~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_28, ~y~0=v_~y~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:40:30,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L786-->L789: Formula: (= v_~y~0_5 1) InVars {} OutVars{~y~0=v_~y~0_5} AuxVars[] AssignedVars[~y~0] and [327] L769-->L776: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_102 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_27 (ite .cse3 0 v_~y$r_buff0_thd2~0_28)) (= v_~y~0_63 (ite .cse2 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_34 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:40:30,787 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L786-->L789: Formula: (= v_~y~0_5 1) InVars {} OutVars{~y~0=v_~y~0_5} AuxVars[] AssignedVars[~y~0] and [321] L752-->L759: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_95 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_29 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_96 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4))) (and (= (ite .cse0 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_30 v_~y~0_56)) v_~y~0_55) (= v_~y$r_buff0_thd1~0_28 (ite .cse2 0 v_~y$r_buff0_thd1~0_29)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd1~0_28 256) 0)) .cse4)) 0 v_~y$r_buff1_thd1~0_20) v_~y$r_buff1_thd1~0_19) (= (ite .cse0 0 v_~y$w_buff0_used~0_96) v_~y$w_buff0_used~0_95) (= v_~y$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_95))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y~0=v_~y~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_28, ~y~0=v_~y~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:40:30,926 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:40:30,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 687 [2022-12-06 06:40:30,927 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 703 flow [2022-12-06 06:40:30,927 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:40:30,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:30,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:30,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:40:30,927 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:30,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:30,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1263867747, now seen corresponding path program 1 times [2022-12-06 06:40:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:30,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825744577] [2022-12-06 06:40:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:30,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:31,033 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:40:31,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:31,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825744577] [2022-12-06 06:40:31,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825744577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:31,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:31,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:40:31,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215276648] [2022-12-06 06:40:31,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:31,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:40:31,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:31,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:40:31,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:40:31,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 06:40:31,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 703 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:40:31,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:31,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 06:40:31,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:31,316 INFO L130 PetriNetUnfolder]: 903/1598 cut-off events. [2022-12-06 06:40:31,317 INFO L131 PetriNetUnfolder]: For 11017/11017 co-relation queries the response was YES. [2022-12-06 06:40:31,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8675 conditions, 1598 events. 903/1598 cut-off events. For 11017/11017 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8894 event pairs, 231 based on Foata normal form. 24/1622 useless extension candidates. Maximal degree in co-relation 8642. Up to 827 conditions per place. [2022-12-06 06:40:31,327 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 60 selfloop transitions, 6 changer transitions 52/120 dead transitions. [2022-12-06 06:40:31,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 120 transitions, 1583 flow [2022-12-06 06:40:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:40:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:40:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 06:40:31,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-06 06:40:31,329 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 703 flow. Second operand 4 states and 69 transitions. [2022-12-06 06:40:31,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 120 transitions, 1583 flow [2022-12-06 06:40:31,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 120 transitions, 1499 flow, removed 38 selfloop flow, removed 2 redundant places. [2022-12-06 06:40:31,341 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 531 flow [2022-12-06 06:40:31,341 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2022-12-06 06:40:31,342 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2022-12-06 06:40:31,342 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:31,342 INFO L89 Accepts]: Start accepts. Operand has 65 places, 52 transitions, 531 flow [2022-12-06 06:40:31,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:31,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:31,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 52 transitions, 531 flow [2022-12-06 06:40:31,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 52 transitions, 531 flow [2022-12-06 06:40:31,379 INFO L130 PetriNetUnfolder]: 179/456 cut-off events. [2022-12-06 06:40:31,380 INFO L131 PetriNetUnfolder]: For 2106/2167 co-relation queries the response was YES. [2022-12-06 06:40:31,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 456 events. 179/456 cut-off events. For 2106/2167 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 2887 event pairs, 60 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 1994. Up to 216 conditions per place. [2022-12-06 06:40:31,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 52 transitions, 531 flow [2022-12-06 06:40:31,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 06:40:31,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] L786-->L749: Formula: (and (= v_~y$w_buff0_used~0_371 1) (= v_~y$r_buff0_thd1~0_118 1) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_24| 0)) (= v_~y~0_302 1) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_22| |v_P0Thread1of1ForFork2_~arg#1.base_22|) (= v_~y$r_buff0_thd3~0_90 v_~y$r_buff1_thd3~0_82) (= 2 v_~y$w_buff0~0_226) (= v_~y$w_buff1~0_201 v_~y$w_buff0~0_227) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_22| |v_P0Thread1of1ForFork2_~arg#1.offset_22|) (= v_~y$r_buff0_thd1~0_119 v_~y$r_buff1_thd1~0_88) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_24| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_347 256) 0)) (not (= (mod v_~y$w_buff0_used~0_371 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_215 v_~y$r_buff1_thd0~0_217) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_24| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_24|) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_93) (= v_~y$w_buff0_used~0_372 v_~y$w_buff1_used~0_347)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_372, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_22|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_90, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_215, ~y$w_buff0~0=v_~y$w_buff0~0_227, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_119, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_22|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_22|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_24|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_22|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_22|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_22|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_93, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_82, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_24|, ~y$w_buff1~0=v_~y$w_buff1~0_201, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_90, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_215, ~y$w_buff0~0=v_~y$w_buff0~0_226, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_118, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y~0=v_~y~0_302, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_217, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_347} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [449] L769-->L796: Formula: (let ((.cse14 (not (= (mod v_~y$r_buff0_thd2~0_98 256) 0)))) (let ((.cse8 (and .cse14 (not (= (mod v_~y$w_buff0_used~0_391 256) 0))))) (let ((.cse10 (ite .cse8 0 v_~y$w_buff0_used~0_391))) (let ((.cse5 (not (= (mod v_~y$r_buff1_thd2~0_100 256) 0))) (.cse3 (not (= (mod .cse10 256) 0)))) (let ((.cse6 (and .cse14 .cse3)) (.cse9 (and (not (= (mod v_~y$w_buff1_used~0_365 256) 0)) .cse5))) (let ((.cse2 (ite (or .cse6 .cse9) 0 v_~y$w_buff1_used~0_365))) (let ((.cse11 (not (= (mod v_~y$w_buff0_used~0_389 256) 0))) (.cse13 (not (= (mod v_~y$r_buff0_thd3~0_93 256) 0))) (.cse12 (not (= (mod v_~y$r_buff1_thd3~0_85 256) 0))) (.cse4 (not (= (mod .cse2 256) 0)))) (let ((.cse0 (and .cse12 .cse4)) (.cse7 (and .cse3 .cse13)) (.cse1 (and .cse13 .cse11))) (and (= v_~y$w_buff1_used~0_363 (ite (or .cse0 .cse1) 0 .cse2)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_97 256) 0))) (and .cse4 .cse5)) 0 v_~y$r_buff1_thd2~0_100) v_~y$r_buff1_thd2~0_99) (= (ite .cse6 0 v_~y$r_buff0_thd2~0_98) v_~y$r_buff0_thd2~0_97) (= v_~y~0_318 (ite .cse7 v_~y$w_buff0~0_238 (ite .cse0 v_~y$w_buff1~0_211 (ite .cse8 v_~y$w_buff0~0_238 (ite .cse9 v_~y$w_buff1~0_211 v_~y~0_320))))) (= v_~y$w_buff0_used~0_389 (ite .cse7 0 .cse10)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_93) v_~y$r_buff0_thd3~0_92) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_92 256) 0)) .cse11) (and .cse12 (not (= (mod v_~y$w_buff1_used~0_363 256) 0)))) 0 v_~y$r_buff1_thd3~0_85) v_~y$r_buff1_thd3~0_84)))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_100, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_85, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_391, ~y$w_buff1~0=v_~y$w_buff1~0_211, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~y$w_buff0~0=v_~y$w_buff0~0_238, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_98, ~y~0=v_~y~0_320, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_365} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_99, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_84, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_389, ~y$w_buff1~0=v_~y$w_buff1~0_211, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_238, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_97, ~y~0=v_~y~0_318, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_363} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:40:31,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] L786-->L749: Formula: (and (= v_~y$w_buff0_used~0_371 1) (= v_~y$r_buff0_thd1~0_118 1) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_24| 0)) (= v_~y~0_302 1) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_22| |v_P0Thread1of1ForFork2_~arg#1.base_22|) (= v_~y$r_buff0_thd3~0_90 v_~y$r_buff1_thd3~0_82) (= 2 v_~y$w_buff0~0_226) (= v_~y$w_buff1~0_201 v_~y$w_buff0~0_227) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_22| |v_P0Thread1of1ForFork2_~arg#1.offset_22|) (= v_~y$r_buff0_thd1~0_119 v_~y$r_buff1_thd1~0_88) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_24| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_347 256) 0)) (not (= (mod v_~y$w_buff0_used~0_371 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_215 v_~y$r_buff1_thd0~0_217) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_24| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_24|) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_93) (= v_~y$w_buff0_used~0_372 v_~y$w_buff1_used~0_347)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_372, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_22|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_90, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_215, ~y$w_buff0~0=v_~y$w_buff0~0_227, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_119, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_22|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_22|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_24|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_22|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_22|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_22|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_93, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_82, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_24|, ~y$w_buff1~0=v_~y$w_buff1~0_201, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_90, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_215, ~y$w_buff0~0=v_~y$w_buff0~0_226, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_118, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y~0=v_~y~0_302, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_217, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_347} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [334] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse4 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_23 256) 0)) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_82 256) 0)))) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_83) v_~y$w_buff1_used~0_82) (= v_~y$r_buff0_thd3~0_23 (ite .cse4 0 v_~y$r_buff0_thd3~0_24)) (= v_~y~0_47 (ite .cse0 v_~y$w_buff0~0_31 (ite .cse3 v_~y$w_buff1~0_24 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_31, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~y$w_buff0~0=v_~y$w_buff0~0_31, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:40:31,785 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] L786-->L749: Formula: (and (= v_~y$w_buff0_used~0_371 1) (= v_~y$r_buff0_thd1~0_118 1) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_24| 0)) (= v_~y~0_302 1) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_22| |v_P0Thread1of1ForFork2_~arg#1.base_22|) (= v_~y$r_buff0_thd3~0_90 v_~y$r_buff1_thd3~0_82) (= 2 v_~y$w_buff0~0_226) (= v_~y$w_buff1~0_201 v_~y$w_buff0~0_227) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_22| |v_P0Thread1of1ForFork2_~arg#1.offset_22|) (= v_~y$r_buff0_thd1~0_119 v_~y$r_buff1_thd1~0_88) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_24| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_347 256) 0)) (not (= (mod v_~y$w_buff0_used~0_371 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_215 v_~y$r_buff1_thd0~0_217) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_24| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_24|) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_93) (= v_~y$w_buff0_used~0_372 v_~y$w_buff1_used~0_347)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_372, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_22|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_90, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_215, ~y$w_buff0~0=v_~y$w_buff0~0_227, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_119, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_22|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_22|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_24|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_22|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_22|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_22|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_93, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_82, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_24|, ~y$w_buff1~0=v_~y$w_buff1~0_201, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_90, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_215, ~y$w_buff0~0=v_~y$w_buff0~0_226, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_118, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y~0=v_~y~0_302, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_217, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_347} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [327] L769-->L776: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_102 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_27 (ite .cse3 0 v_~y$r_buff0_thd2~0_28)) (= v_~y~0_63 (ite .cse2 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_34 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:40:31,941 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:40:31,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 599 [2022-12-06 06:40:31,941 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 543 flow [2022-12-06 06:40:31,942 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:40:31,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:31,942 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:31,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:40:31,942 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:31,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1409157810, now seen corresponding path program 1 times [2022-12-06 06:40:31,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:31,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763464272] [2022-12-06 06:40:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:32,394 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:40:32,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:32,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763464272] [2022-12-06 06:40:32,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763464272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:32,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:32,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:40:32,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417029673] [2022-12-06 06:40:32,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:32,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:40:32,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:32,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:40:32,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:40:32,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 06:40:32,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 543 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:32,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:32,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 06:40:32,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:32,633 INFO L130 PetriNetUnfolder]: 517/921 cut-off events. [2022-12-06 06:40:32,634 INFO L131 PetriNetUnfolder]: For 6095/6117 co-relation queries the response was YES. [2022-12-06 06:40:32,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4948 conditions, 921 events. 517/921 cut-off events. For 6095/6117 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4403 event pairs, 146 based on Foata normal form. 25/946 useless extension candidates. Maximal degree in co-relation 4914. Up to 789 conditions per place. [2022-12-06 06:40:32,641 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 48 selfloop transitions, 13 changer transitions 12/75 dead transitions. [2022-12-06 06:40:32,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 844 flow [2022-12-06 06:40:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:40:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:40:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 06:40:32,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-06 06:40:32,642 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 543 flow. Second operand 4 states and 54 transitions. [2022-12-06 06:40:32,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 844 flow [2022-12-06 06:40:32,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 762 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-12-06 06:40:32,651 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 464 flow [2022-12-06 06:40:32,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=464, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2022-12-06 06:40:32,652 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2022-12-06 06:40:32,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:32,652 INFO L89 Accepts]: Start accepts. Operand has 63 places, 46 transitions, 464 flow [2022-12-06 06:40:32,653 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:32,653 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:32,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 46 transitions, 464 flow [2022-12-06 06:40:32,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 46 transitions, 464 flow [2022-12-06 06:40:32,686 INFO L130 PetriNetUnfolder]: 171/437 cut-off events. [2022-12-06 06:40:32,686 INFO L131 PetriNetUnfolder]: For 1753/1781 co-relation queries the response was YES. [2022-12-06 06:40:32,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1811 conditions, 437 events. 171/437 cut-off events. For 1753/1781 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2724 event pairs, 71 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 1782. Up to 203 conditions per place. [2022-12-06 06:40:32,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 46 transitions, 464 flow [2022-12-06 06:40:32,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 06:40:32,691 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:32,691 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 06:40:32,691 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 464 flow [2022-12-06 06:40:32,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:40:32,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:32,692 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:32,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:40:32,692 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1309689186, now seen corresponding path program 1 times [2022-12-06 06:40:32,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:32,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469623350] [2022-12-06 06:40:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:32,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:33,212 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:40:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:33,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469623350] [2022-12-06 06:40:33,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469623350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:33,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:33,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:40:33,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776391282] [2022-12-06 06:40:33,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:33,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:40:33,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:33,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:40:33,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:40:33,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 06:40:33,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:40:33,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:33,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 06:40:33,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:33,438 INFO L130 PetriNetUnfolder]: 504/905 cut-off events. [2022-12-06 06:40:33,438 INFO L131 PetriNetUnfolder]: For 5378/5400 co-relation queries the response was YES. [2022-12-06 06:40:33,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4593 conditions, 905 events. 504/905 cut-off events. For 5378/5400 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4300 event pairs, 157 based on Foata normal form. 25/930 useless extension candidates. Maximal degree in co-relation 4561. Up to 721 conditions per place. [2022-12-06 06:40:33,443 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 44 selfloop transitions, 10 changer transitions 12/68 dead transitions. [2022-12-06 06:40:33,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 718 flow [2022-12-06 06:40:33,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:40:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:40:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 06:40:33,444 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 06:40:33,444 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 464 flow. Second operand 4 states and 52 transitions. [2022-12-06 06:40:33,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 718 flow [2022-12-06 06:40:33,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 643 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-06 06:40:33,451 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 391 flow [2022-12-06 06:40:33,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2022-12-06 06:40:33,451 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2022-12-06 06:40:33,451 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:33,451 INFO L89 Accepts]: Start accepts. Operand has 59 places, 42 transitions, 391 flow [2022-12-06 06:40:33,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:33,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:33,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 42 transitions, 391 flow [2022-12-06 06:40:33,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 42 transitions, 391 flow [2022-12-06 06:40:33,482 INFO L130 PetriNetUnfolder]: 166/426 cut-off events. [2022-12-06 06:40:33,483 INFO L131 PetriNetUnfolder]: For 1231/1247 co-relation queries the response was YES. [2022-12-06 06:40:33,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 426 events. 166/426 cut-off events. For 1231/1247 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2648 event pairs, 63 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 1567. Up to 196 conditions per place. [2022-12-06 06:40:33,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 42 transitions, 391 flow [2022-12-06 06:40:33,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 06:40:33,487 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:33,487 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 06:40:33,487 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 391 flow [2022-12-06 06:40:33,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:40:33,488 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:33,488 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:33,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:40:33,488 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:33,488 INFO L85 PathProgramCache]: Analyzing trace with hash 461973005, now seen corresponding path program 2 times [2022-12-06 06:40:33,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:33,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990341400] [2022-12-06 06:40:33,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:33,573 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:40:33,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:33,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990341400] [2022-12-06 06:40:33,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990341400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:33,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:33,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:40:33,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686998433] [2022-12-06 06:40:33,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:33,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:40:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:33,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:40:33,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:40:33,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 06:40:33,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:40:33,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:33,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 06:40:33,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:33,656 INFO L130 PetriNetUnfolder]: 231/467 cut-off events. [2022-12-06 06:40:33,656 INFO L131 PetriNetUnfolder]: For 2022/2037 co-relation queries the response was YES. [2022-12-06 06:40:33,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 467 events. 231/467 cut-off events. For 2022/2037 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2085 event pairs, 40 based on Foata normal form. 64/529 useless extension candidates. Maximal degree in co-relation 2247. Up to 200 conditions per place. [2022-12-06 06:40:33,658 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 55 selfloop transitions, 7 changer transitions 3/69 dead transitions. [2022-12-06 06:40:33,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 728 flow [2022-12-06 06:40:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:40:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:40:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 06:40:33,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 06:40:33,660 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 391 flow. Second operand 4 states and 52 transitions. [2022-12-06 06:40:33,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 728 flow [2022-12-06 06:40:33,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 678 flow, removed 1 selfloop flow, removed 7 redundant places. [2022-12-06 06:40:33,663 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 387 flow [2022-12-06 06:40:33,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=387, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-06 06:40:33,663 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-06 06:40:33,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:33,663 INFO L89 Accepts]: Start accepts. Operand has 55 places, 45 transitions, 387 flow [2022-12-06 06:40:33,664 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:33,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:33,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 387 flow [2022-12-06 06:40:33,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 387 flow [2022-12-06 06:40:33,681 INFO L130 PetriNetUnfolder]: 76/234 cut-off events. [2022-12-06 06:40:33,681 INFO L131 PetriNetUnfolder]: For 624/657 co-relation queries the response was YES. [2022-12-06 06:40:33,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 234 events. 76/234 cut-off events. For 624/657 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1216 event pairs, 20 based on Foata normal form. 14/242 useless extension candidates. Maximal degree in co-relation 1002. Up to 108 conditions per place. [2022-12-06 06:40:33,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 387 flow [2022-12-06 06:40:33,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 06:40:33,684 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:33,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:40:33,684 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 387 flow [2022-12-06 06:40:33,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:40:33,685 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:33,685 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:33,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 06:40:33,685 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash -613836656, now seen corresponding path program 1 times [2022-12-06 06:40:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:33,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058627910] [2022-12-06 06:40:33,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:33,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:34,229 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:40:34,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:34,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058627910] [2022-12-06 06:40:34,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058627910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:34,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:34,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:40:34,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813626165] [2022-12-06 06:40:34,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:34,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:40:34,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:34,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:40:34,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:40:34,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 06:40:34,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:40:34,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:34,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 06:40:34,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:34,423 INFO L130 PetriNetUnfolder]: 306/614 cut-off events. [2022-12-06 06:40:34,424 INFO L131 PetriNetUnfolder]: For 2234/2242 co-relation queries the response was YES. [2022-12-06 06:40:34,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2996 conditions, 614 events. 306/614 cut-off events. For 2234/2242 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2888 event pairs, 50 based on Foata normal form. 16/630 useless extension candidates. Maximal degree in co-relation 2968. Up to 323 conditions per place. [2022-12-06 06:40:34,427 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 47 selfloop transitions, 10 changer transitions 11/69 dead transitions. [2022-12-06 06:40:34,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 655 flow [2022-12-06 06:40:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:40:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:40:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 06:40:34,428 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-06 06:40:34,428 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 387 flow. Second operand 5 states and 48 transitions. [2022-12-06 06:40:34,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 655 flow [2022-12-06 06:40:34,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 629 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 06:40:34,431 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 355 flow [2022-12-06 06:40:34,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2022-12-06 06:40:34,432 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-12-06 06:40:34,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:34,432 INFO L89 Accepts]: Start accepts. Operand has 58 places, 40 transitions, 355 flow [2022-12-06 06:40:34,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:34,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:34,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 40 transitions, 355 flow [2022-12-06 06:40:34,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 40 transitions, 355 flow [2022-12-06 06:40:34,445 INFO L130 PetriNetUnfolder]: 48/154 cut-off events. [2022-12-06 06:40:34,445 INFO L131 PetriNetUnfolder]: For 434/449 co-relation queries the response was YES. [2022-12-06 06:40:34,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 154 events. 48/154 cut-off events. For 434/449 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 680 event pairs, 10 based on Foata normal form. 8/158 useless extension candidates. Maximal degree in co-relation 616. Up to 69 conditions per place. [2022-12-06 06:40:34,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 40 transitions, 355 flow [2022-12-06 06:40:34,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-06 06:40:34,651 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] L749-->L752: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [359] $Ultimate##0-->L786: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_~x~0_24 v_~__unbuffered_p2_EAX~0_18) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_24} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] [2022-12-06 06:40:34,666 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] L749-->L752: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [383] $Ultimate##0-->L769: Formula: (and (= v_~x~0_35 2) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-06 06:40:34,881 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:40:34,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 450 [2022-12-06 06:40:34,882 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 373 flow [2022-12-06 06:40:34,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:40:34,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:34,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:34,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 06:40:34,882 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:40:34,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:34,882 INFO L85 PathProgramCache]: Analyzing trace with hash -173443419, now seen corresponding path program 1 times [2022-12-06 06:40:34,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:34,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026756488] [2022-12-06 06:40:34,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:40:34,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:34,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026756488] [2022-12-06 06:40:34,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026756488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:34,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:34,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:40:34,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962409972] [2022-12-06 06:40:34,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:34,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:40:34,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:34,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:40:34,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:40:34,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:40:34,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 373 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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:40:34,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:34,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:40:34,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:35,079 INFO L130 PetriNetUnfolder]: 122/235 cut-off events. [2022-12-06 06:40:35,080 INFO L131 PetriNetUnfolder]: For 1196/1196 co-relation queries the response was YES. [2022-12-06 06:40:35,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 235 events. 122/235 cut-off events. For 1196/1196 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 817 event pairs, 17 based on Foata normal form. 14/248 useless extension candidates. Maximal degree in co-relation 1194. Up to 100 conditions per place. [2022-12-06 06:40:35,081 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 38 selfloop transitions, 10 changer transitions 10/59 dead transitions. [2022-12-06 06:40:35,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 650 flow [2022-12-06 06:40:35,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:40:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:40:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 06:40:35,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 06:40:35,082 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 373 flow. Second operand 5 states and 51 transitions. [2022-12-06 06:40:35,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 650 flow [2022-12-06 06:40:35,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 517 flow, removed 34 selfloop flow, removed 11 redundant places. [2022-12-06 06:40:35,084 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 261 flow [2022-12-06 06:40:35,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2022-12-06 06:40:35,085 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2022-12-06 06:40:35,085 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:35,085 INFO L89 Accepts]: Start accepts. Operand has 50 places, 34 transitions, 261 flow [2022-12-06 06:40:35,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:35,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:35,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 34 transitions, 261 flow [2022-12-06 06:40:35,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 34 transitions, 261 flow [2022-12-06 06:40:35,095 INFO L130 PetriNetUnfolder]: 17/60 cut-off events. [2022-12-06 06:40:35,095 INFO L131 PetriNetUnfolder]: For 107/109 co-relation queries the response was YES. [2022-12-06 06:40:35,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 60 events. 17/60 cut-off events. For 107/109 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 173 event pairs, 1 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 239. Up to 19 conditions per place. [2022-12-06 06:40:35,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 34 transitions, 261 flow [2022-12-06 06:40:35,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 Received shutdown request... [2022-12-06 06:54:44,842 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:54:44,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 06:54:44,843 WARN L619 AbstractCegarLoop]: Verification canceled: while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. [2022-12-06 06:54:44,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:54:44,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:54:44,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:54:44,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:54:44,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:54:44,844 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:54:44,847 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:54:44,847 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:54:44,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:54:44 BasicIcfg [2022-12-06 06:54:44,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:54:44,851 INFO L158 Benchmark]: Toolchain (without parser) took 872534.23ms. Allocated memory was 201.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 160.4MB in the beginning and 1.1GB in the end (delta: -922.8MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-06 06:54:44,851 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:54:44,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.27ms. Allocated memory is still 201.3MB. Free memory was 160.4MB in the beginning and 134.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:54:44,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.76ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 131.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:54:44,852 INFO L158 Benchmark]: Boogie Preprocessor took 18.91ms. Allocated memory is still 201.3MB. Free memory was 131.6MB in the beginning and 129.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:54:44,852 INFO L158 Benchmark]: RCFGBuilder took 523.27ms. Allocated memory is still 201.3MB. Free memory was 129.5MB in the beginning and 95.4MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 06:54:44,852 INFO L158 Benchmark]: TraceAbstraction took 871475.70ms. Allocated memory was 201.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 94.4MB in the beginning and 1.1GB in the end (delta: -988.9MB). Peak memory consumption was 954.3MB. Max. memory is 8.0GB. [2022-12-06 06:54:44,853 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.27ms. Allocated memory is still 201.3MB. Free memory was 160.4MB in the beginning and 134.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.76ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 131.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.91ms. Allocated memory is still 201.3MB. Free memory was 131.6MB in the beginning and 129.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 523.27ms. Allocated memory is still 201.3MB. Free memory was 129.5MB in the beginning and 95.4MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 871475.70ms. Allocated memory was 201.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 94.4MB in the beginning and 1.1GB in the end (delta: -988.9MB). Peak memory consumption was 954.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 110 PlacesBefore, 36 PlacesAfterwards, 102 TransitionsBefore, 27 TransitionsAfterwards, 1818 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 1265, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1111, independent: 1079, independent conditional: 0, independent unconditional: 1079, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1111, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 209, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1317, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1111, unknown conditional: 0, unknown unconditional: 1111] , Statistics on independence cache: Total cache size (in pairs): 1720, Positive cache size: 1688, Positive conditional cache size: 0, Positive unconditional cache size: 1688, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 45, independent conditional: 45, 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: 65, independent: 45, independent conditional: 9, independent unconditional: 36, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 45, independent conditional: 9, independent unconditional: 36, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 45, independent conditional: 9, independent unconditional: 36, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 45, independent conditional: 9, independent unconditional: 36, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 93, dependent conditional: 11, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 60, unknown conditional: 11, unknown unconditional: 49] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 45, Positive conditional cache size: 9, Positive unconditional cache size: 36, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 50, independent conditional: 50, 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: 58, independent: 50, independent conditional: 17, independent unconditional: 33, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 50, independent conditional: 4, independent unconditional: 46, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 50, independent conditional: 4, independent unconditional: 46, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 1, independent unconditional: 11, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 38, independent conditional: 3, independent unconditional: 35, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 14, unknown conditional: 2, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 57, Positive conditional cache size: 10, Positive unconditional cache size: 47, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 31, independent conditional: 31, 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: 39, independent: 31, independent conditional: 15, independent unconditional: 16, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 31, independent conditional: 3, independent unconditional: 28, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 31, independent conditional: 3, independent unconditional: 28, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 60, Positive conditional cache size: 10, Positive unconditional cache size: 50, Negative cache size: 18, Negative conditional cache size: 4, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 25, independent conditional: 20, independent unconditional: 5, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 25, independent conditional: 13, independent unconditional: 12, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 25, independent conditional: 13, independent unconditional: 12, dependent: 7, dependent conditional: 4, dependent unconditional: 3, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 25, independent conditional: 13, independent unconditional: 12, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 60, Positive conditional cache size: 10, Positive unconditional cache size: 50, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, 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, 39 PlacesBefore, 39 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 34, independent conditional: 20, independent unconditional: 14, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 34, independent conditional: 7, independent unconditional: 27, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 34, independent conditional: 7, independent unconditional: 27, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 32, independent conditional: 7, independent unconditional: 25, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 62, Positive conditional cache size: 10, Positive unconditional cache size: 52, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 51, independent conditional: 26, independent unconditional: 25, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 51, independent conditional: 17, independent unconditional: 34, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 51, independent conditional: 17, independent unconditional: 34, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 46, independent conditional: 17, independent unconditional: 29, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 67, Positive conditional cache size: 10, Positive unconditional cache size: 57, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 80, independent conditional: 80, 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: 90, independent: 80, independent conditional: 25, independent unconditional: 55, 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: 90, independent: 80, independent conditional: 10, independent unconditional: 70, 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: 90, independent: 80, independent conditional: 10, independent unconditional: 70, 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: 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: 90, independent: 80, independent conditional: 10, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 67, Positive conditional cache size: 10, Positive unconditional cache size: 57, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 55 PlacesBefore, 54 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 273, independent: 241, independent conditional: 241, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 273, independent: 241, independent conditional: 102, independent unconditional: 139, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 273, independent: 241, independent conditional: 36, independent unconditional: 205, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 273, independent: 241, independent conditional: 36, independent unconditional: 205, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 273, independent: 236, independent conditional: 36, independent unconditional: 200, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 79, Positive conditional cache size: 10, Positive unconditional cache size: 69, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 114, independent conditional: 114, 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: 130, independent: 114, independent conditional: 54, independent unconditional: 60, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 114, independent conditional: 27, independent unconditional: 87, 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: 130, independent: 114, independent conditional: 27, independent unconditional: 87, 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: 130, independent: 114, independent conditional: 27, independent unconditional: 87, 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): 98, Positive cache size: 79, Positive conditional cache size: 10, Positive unconditional cache size: 69, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 230, independent: 207, independent conditional: 207, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 230, independent: 207, independent conditional: 94, independent unconditional: 113, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 230, independent: 207, independent conditional: 55, independent unconditional: 152, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 230, independent: 207, independent conditional: 55, independent unconditional: 152, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 230, independent: 204, independent conditional: 53, independent unconditional: 151, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 82, Positive conditional cache size: 12, Positive unconditional cache size: 70, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 62 PlacesBefore, 63 PlacesAfterwards, 64 TransitionsBefore, 65 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 333, independent: 289, independent conditional: 289, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 333, independent: 289, independent conditional: 158, independent unconditional: 131, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 333, independent: 289, independent conditional: 72, independent unconditional: 217, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 333, independent: 289, independent conditional: 72, independent unconditional: 217, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 333, independent: 286, independent conditional: 70, independent unconditional: 216, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 87, Positive conditional cache size: 14, Positive unconditional cache size: 73, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 86, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213, independent: 189, independent conditional: 92, independent unconditional: 97, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 213, independent: 189, independent conditional: 49, independent unconditional: 140, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 213, independent: 189, independent conditional: 49, independent unconditional: 140, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 213, independent: 189, independent conditional: 49, independent unconditional: 140, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 87, Positive conditional cache size: 14, Positive unconditional cache size: 73, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 294, independent: 265, independent conditional: 265, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 294, independent: 265, independent conditional: 117, independent unconditional: 148, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 294, independent: 265, independent conditional: 73, independent unconditional: 192, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 294, independent: 265, independent conditional: 73, independent unconditional: 192, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 294, independent: 263, independent conditional: 71, independent unconditional: 192, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 89, Positive conditional cache size: 16, Positive unconditional cache size: 73, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 64 PlacesBefore, 63 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 52, 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: 52, independent: 52, independent conditional: 46, independent unconditional: 6, 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: 52, independent: 52, independent conditional: 16, independent unconditional: 36, 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: 52, independent: 52, independent conditional: 16, independent unconditional: 36, 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: 4, independent: 4, independent conditional: 2, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 52, independent: 48, independent conditional: 14, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 104, Positive conditional cache size: 18, Positive unconditional cache size: 86, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 65 PlacesBefore, 64 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 104, Positive conditional cache size: 18, Positive unconditional cache size: 86, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, 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.0s, 61 PlacesBefore, 61 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 104, Positive conditional cache size: 18, Positive unconditional cache size: 86, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, 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.0s, 58 PlacesBefore, 58 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 104, Positive conditional cache size: 18, Positive unconditional cache size: 86, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, 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.0s, 55 PlacesBefore, 55 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 104, Positive conditional cache size: 18, Positive unconditional cache size: 86, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, 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.4s, 58 PlacesBefore, 56 PlacesAfterwards, 40 TransitionsBefore, 38 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 46, independent conditional: 20, independent unconditional: 26, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 46, independent conditional: 20, independent unconditional: 26, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 37, independent conditional: 17, independent unconditional: 20, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 12, unknown conditional: 5, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 137, Positive conditional cache size: 21, Positive unconditional cache size: 116, Negative cache size: 22, Negative conditional cache size: 7, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 1 - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - TimeoutResultAtElement [Line: 818]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - TimeoutResultAtElement [Line: 814]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 871.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 493 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 493 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1560 IncrementalHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 20 mSDtfsCounter, 1560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=862occurred in iteration=13, InterpolantAutomatonStates: 85, 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.3s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 3977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 [2022-12-06 06:54:44,864 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown