/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/mix042.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:53:44,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:53:44,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:53:44,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:53:44,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:53:44,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:53:44,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:53:44,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:53:44,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:53:44,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:53:44,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:53:44,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:53:44,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:53:44,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:53:44,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:53:44,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:53:44,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:53:44,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:53:44,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:53:44,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:53:44,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:53:44,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:53:44,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:53:44,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:53:44,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:53:44,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:53:44,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:53:44,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:53:44,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:53:44,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:53:44,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:53:44,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:53:44,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:53:44,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:53:44,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:53:44,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:53:44,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:53:44,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:53:44,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:53:44,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:53:44,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:53:44,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:53:44,876 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:53:44,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:53:44,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:53:44,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:53:44,879 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:53:44,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:53:44,879 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:53:44,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:53:44,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:53:44,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:53:44,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:53:44,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:53:44,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:53:44,880 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:53:44,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:53:44,881 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:53:44,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:53:44,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:53:44,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:53:44,881 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:53:44,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:53:44,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:53:44,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:53:44,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:53:44,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:53:44,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:53:44,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:53:44,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:53:44,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:53:45,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:53:45,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:53:45,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:53:45,161 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:53:45,162 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:53:45,163 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042.oepc.i [2022-12-13 11:53:46,246 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:53:46,518 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:53:46,519 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.oepc.i [2022-12-13 11:53:46,548 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/290910192/812a18c8d13c4df490df9d232f2b4cdd/FLAG51582a073 [2022-12-13 11:53:46,558 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/290910192/812a18c8d13c4df490df9d232f2b4cdd [2022-12-13 11:53:46,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:53:46,561 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:53:46,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:53:46,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:53:46,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:53:46,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:53:46" (1/1) ... [2022-12-13 11:53:46,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75937c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:46, skipping insertion in model container [2022-12-13 11:53:46,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:53:46" (1/1) ... [2022-12-13 11:53:46,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:53:46,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:53:46,754 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/mix042.oepc.i[945,958] [2022-12-13 11:53:46,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:53:46,944 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:53:46,954 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/mix042.oepc.i[945,958] [2022-12-13 11:53:46,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:53:46,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:53:46,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:53:47,010 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:53:47,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47 WrapperNode [2022-12-13 11:53:47,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:53:47,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:53:47,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:53:47,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:53:47,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (1/1) ... [2022-12-13 11:53:47,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (1/1) ... [2022-12-13 11:53:47,060 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-13 11:53:47,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:53:47,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:53:47,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:53:47,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:53:47,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (1/1) ... [2022-12-13 11:53:47,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (1/1) ... [2022-12-13 11:53:47,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (1/1) ... [2022-12-13 11:53:47,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (1/1) ... [2022-12-13 11:53:47,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (1/1) ... [2022-12-13 11:53:47,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (1/1) ... [2022-12-13 11:53:47,088 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (1/1) ... [2022-12-13 11:53:47,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (1/1) ... [2022-12-13 11:53:47,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:53:47,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:53:47,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:53:47,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:53:47,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (1/1) ... [2022-12-13 11:53:47,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:53:47,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:53:47,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:53:47,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:53:47,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:53:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:53:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:53:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:53:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:53:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:53:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:53:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:53:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:53:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:53:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:53:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:53:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:53:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:53:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:53:47,212 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:53:47,363 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:53:47,364 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:53:47,589 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:53:47,664 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:53:47,664 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:53:47,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:53:47 BoogieIcfgContainer [2022-12-13 11:53:47,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:53:47,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:53:47,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:53:47,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:53:47,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:53:46" (1/3) ... [2022-12-13 11:53:47,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f6b28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:53:47, skipping insertion in model container [2022-12-13 11:53:47,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:53:47" (2/3) ... [2022-12-13 11:53:47,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f6b28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:53:47, skipping insertion in model container [2022-12-13 11:53:47,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:53:47" (3/3) ... [2022-12-13 11:53:47,671 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2022-12-13 11:53:47,683 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:53:47,684 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:53:47,684 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:53:47,723 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:53:47,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-13 11:53:47,805 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-13 11:53:47,806 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:53:47,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 11:53:47,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-13 11:53:47,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-13 11:53:47,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:47,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-13 11:53:47,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-13 11:53:47,860 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-13 11:53:47,861 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:53:47,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 11:53:47,864 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-13 11:53:47,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-13 11:53:51,908 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 11:53:51,926 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:53:51,931 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;@7822281d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:53:51,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:53:51,935 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 11:53:51,935 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:53:51,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:51,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 11:53:51,937 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:51,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:51,941 INFO L85 PathProgramCache]: Analyzing trace with hash 515099, now seen corresponding path program 1 times [2022-12-13 11:53:51,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:51,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919605691] [2022-12-13 11:53:51,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:52,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:52,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919605691] [2022-12-13 11:53:52,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919605691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:52,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:52,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:53:52,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767172665] [2022-12-13 11:53:52,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:52,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:53:52,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:52,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:53:52,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:53:52,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 69 [2022-12-13 11:53:52,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:52,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:52,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 69 [2022-12-13 11:53:52,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:53,786 INFO L130 PetriNetUnfolder]: 10840/17378 cut-off events. [2022-12-13 11:53:53,786 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 11:53:53,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32841 conditions, 17378 events. 10840/17378 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 136902 event pairs, 1440 based on Foata normal form. 0/10486 useless extension candidates. Maximal degree in co-relation 32830. Up to 13045 conditions per place. [2022-12-13 11:53:53,835 INFO L137 encePairwiseOnDemand]: 63/69 looper letters, 38 selfloop transitions, 2 changer transitions 59/111 dead transitions. [2022-12-13 11:53:53,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 111 transitions, 433 flow [2022-12-13 11:53:53,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:53:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:53:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-12-13 11:53:53,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2022-12-13 11:53:53,845 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 147 flow. Second operand 3 states and 144 transitions. [2022-12-13 11:53:53,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 111 transitions, 433 flow [2022-12-13 11:53:53,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 111 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:53:53,849 INFO L231 Difference]: Finished difference. Result has 74 places, 35 transitions, 80 flow [2022-12-13 11:53:53,851 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=74, PETRI_TRANSITIONS=35} [2022-12-13 11:53:53,853 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2022-12-13 11:53:53,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:53,854 INFO L89 Accepts]: Start accepts. Operand has 74 places, 35 transitions, 80 flow [2022-12-13 11:53:53,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:53,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:53,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 35 transitions, 80 flow [2022-12-13 11:53:53,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2022-12-13 11:53:53,861 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 11:53:53,861 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:53:53,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 85 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:53:53,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2022-12-13 11:53:53,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-13 11:53:54,027 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:53:54,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-13 11:53:54,029 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 80 flow [2022-12-13 11:53:54,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:54,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:54,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:54,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:53:54,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash 5120902, now seen corresponding path program 1 times [2022-12-13 11:53:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:54,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761752650] [2022-12-13 11:53:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:54,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:54,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761752650] [2022-12-13 11:53:54,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761752650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:54,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:54,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:53:54,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910576743] [2022-12-13 11:53:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:54,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:53:54,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:54,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:53:54,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:53:54,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 11:53:54,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:54,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:54,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 11:53:54,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:54,823 INFO L130 PetriNetUnfolder]: 5347/8161 cut-off events. [2022-12-13 11:53:54,824 INFO L131 PetriNetUnfolder]: For 387/387 co-relation queries the response was YES. [2022-12-13 11:53:54,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16483 conditions, 8161 events. 5347/8161 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 48067 event pairs, 1687 based on Foata normal form. 0/6427 useless extension candidates. Maximal degree in co-relation 16473. Up to 5109 conditions per place. [2022-12-13 11:53:54,849 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 42 selfloop transitions, 7 changer transitions 2/59 dead transitions. [2022-12-13 11:53:54,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 236 flow [2022-12-13 11:53:54,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:53:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:53:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-13 11:53:54,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2022-12-13 11:53:54,851 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 80 flow. Second operand 3 states and 76 transitions. [2022-12-13 11:53:54,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 236 flow [2022-12-13 11:53:54,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:53:54,852 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 128 flow [2022-12-13 11:53:54,852 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-13 11:53:54,853 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2022-12-13 11:53:54,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:54,853 INFO L89 Accepts]: Start accepts. Operand has 46 places, 40 transitions, 128 flow [2022-12-13 11:53:54,853 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:54,853 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:54,854 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 128 flow [2022-12-13 11:53:54,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 128 flow [2022-12-13 11:53:54,868 INFO L130 PetriNetUnfolder]: 48/250 cut-off events. [2022-12-13 11:53:54,868 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 11:53:54,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 250 events. 48/250 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1642 event pairs, 20 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 399. Up to 85 conditions per place. [2022-12-13 11:53:54,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 128 flow [2022-12-13 11:53:54,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 764 [2022-12-13 11:53:54,886 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:53:54,887 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 11:53:54,887 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 128 flow [2022-12-13 11:53:54,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:54,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:54,888 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:54,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:53:54,888 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:54,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:54,888 INFO L85 PathProgramCache]: Analyzing trace with hash 158746621, now seen corresponding path program 1 times [2022-12-13 11:53:54,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:54,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519849528] [2022-12-13 11:53:54,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:54,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:55,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:55,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519849528] [2022-12-13 11:53:55,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519849528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:55,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:55,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:53:55,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110014493] [2022-12-13 11:53:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:55,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:53:55,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:55,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:53:55,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:53:55,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2022-12-13 11:53:55,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:55,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:55,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2022-12-13 11:53:55,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:55,463 INFO L130 PetriNetUnfolder]: 3312/5275 cut-off events. [2022-12-13 11:53:55,463 INFO L131 PetriNetUnfolder]: For 953/962 co-relation queries the response was YES. [2022-12-13 11:53:55,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11727 conditions, 5275 events. 3312/5275 cut-off events. For 953/962 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 30795 event pairs, 1225 based on Foata normal form. 95/4334 useless extension candidates. Maximal degree in co-relation 11715. Up to 3349 conditions per place. [2022-12-13 11:53:55,483 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 33 selfloop transitions, 3 changer transitions 2/50 dead transitions. [2022-12-13 11:53:55,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 224 flow [2022-12-13 11:53:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:53:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:53:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 11:53:55,484 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2022-12-13 11:53:55,484 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 128 flow. Second operand 3 states and 65 transitions. [2022-12-13 11:53:55,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 224 flow [2022-12-13 11:53:55,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:53:55,492 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 117 flow [2022-12-13 11:53:55,492 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-13 11:53:55,493 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2022-12-13 11:53:55,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:55,493 INFO L89 Accepts]: Start accepts. Operand has 46 places, 38 transitions, 117 flow [2022-12-13 11:53:55,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:55,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:55,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 117 flow [2022-12-13 11:53:55,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 117 flow [2022-12-13 11:53:55,505 INFO L130 PetriNetUnfolder]: 26/147 cut-off events. [2022-12-13 11:53:55,505 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 11:53:55,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 147 events. 26/147 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 749 event pairs, 4 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 229. Up to 49 conditions per place. [2022-12-13 11:53:55,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 117 flow [2022-12-13 11:53:55,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 706 [2022-12-13 11:53:55,517 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:53:55,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 11:53:55,518 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 117 flow [2022-12-13 11:53:55,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:55,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:55,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:55,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:53:55,519 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash 630124774, now seen corresponding path program 1 times [2022-12-13 11:53:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:55,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783735193] [2022-12-13 11:53:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:55,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:55,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:55,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783735193] [2022-12-13 11:53:55,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783735193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:55,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:55,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:53:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352814850] [2022-12-13 11:53:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:55,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:53:55,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:53:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:53:55,651 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:53:55,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:55,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:55,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:53:55,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:56,064 INFO L130 PetriNetUnfolder]: 3510/5591 cut-off events. [2022-12-13 11:53:56,064 INFO L131 PetriNetUnfolder]: For 790/904 co-relation queries the response was YES. [2022-12-13 11:53:56,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12260 conditions, 5591 events. 3510/5591 cut-off events. For 790/904 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 33586 event pairs, 956 based on Foata normal form. 79/3972 useless extension candidates. Maximal degree in co-relation 12247. Up to 5245 conditions per place. [2022-12-13 11:53:56,103 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 39 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2022-12-13 11:53:56,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 271 flow [2022-12-13 11:53:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:53:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:53:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 11:53:56,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2022-12-13 11:53:56,107 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 117 flow. Second operand 3 states and 70 transitions. [2022-12-13 11:53:56,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 271 flow [2022-12-13 11:53:56,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:53:56,110 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 179 flow [2022-12-13 11:53:56,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2022-12-13 11:53:56,112 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2022-12-13 11:53:56,112 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:56,112 INFO L89 Accepts]: Start accepts. Operand has 46 places, 47 transitions, 179 flow [2022-12-13 11:53:56,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:56,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:56,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 47 transitions, 179 flow [2022-12-13 11:53:56,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 47 transitions, 179 flow [2022-12-13 11:53:56,231 INFO L130 PetriNetUnfolder]: 737/1566 cut-off events. [2022-12-13 11:53:56,231 INFO L131 PetriNetUnfolder]: For 117/174 co-relation queries the response was YES. [2022-12-13 11:53:56,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 1566 events. 737/1566 cut-off events. For 117/174 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 12534 event pairs, 363 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 3083. Up to 1129 conditions per place. [2022-12-13 11:53:56,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 47 transitions, 179 flow [2022-12-13 11:53:56,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 888 [2022-12-13 11:53:56,261 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:53:56,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 11:53:56,266 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 179 flow [2022-12-13 11:53:56,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:56,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:56,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:56,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:53:56,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:56,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1462503557, now seen corresponding path program 1 times [2022-12-13 11:53:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:56,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011466164] [2022-12-13 11:53:56,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:56,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:56,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011466164] [2022-12-13 11:53:56,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011466164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:56,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:56,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:53:56,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398717063] [2022-12-13 11:53:56,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:56,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:53:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:56,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:53:56,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:53:56,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:53:56,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:56,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:56,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:53:56,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:56,698 INFO L130 PetriNetUnfolder]: 1704/3125 cut-off events. [2022-12-13 11:53:56,698 INFO L131 PetriNetUnfolder]: For 487/523 co-relation queries the response was YES. [2022-12-13 11:53:56,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8764 conditions, 3125 events. 1704/3125 cut-off events. For 487/523 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 20222 event pairs, 236 based on Foata normal form. 222/2408 useless extension candidates. Maximal degree in co-relation 8750. Up to 2143 conditions per place. [2022-12-13 11:53:56,712 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 50 selfloop transitions, 19 changer transitions 0/80 dead transitions. [2022-12-13 11:53:56,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 423 flow [2022-12-13 11:53:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:53:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:53:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-13 11:53:56,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2022-12-13 11:53:56,715 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 179 flow. Second operand 4 states and 96 transitions. [2022-12-13 11:53:56,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 423 flow [2022-12-13 11:53:56,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:53:56,720 INFO L231 Difference]: Finished difference. Result has 49 places, 56 transitions, 281 flow [2022-12-13 11:53:56,720 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=49, PETRI_TRANSITIONS=56} [2022-12-13 11:53:56,721 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -29 predicate places. [2022-12-13 11:53:56,722 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:56,722 INFO L89 Accepts]: Start accepts. Operand has 49 places, 56 transitions, 281 flow [2022-12-13 11:53:56,722 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:56,722 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:56,723 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 56 transitions, 281 flow [2022-12-13 11:53:56,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 56 transitions, 281 flow [2022-12-13 11:53:56,781 INFO L130 PetriNetUnfolder]: 428/1086 cut-off events. [2022-12-13 11:53:56,782 INFO L131 PetriNetUnfolder]: For 183/537 co-relation queries the response was YES. [2022-12-13 11:53:56,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3072 conditions, 1086 events. 428/1086 cut-off events. For 183/537 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 8631 event pairs, 90 based on Foata normal form. 9/638 useless extension candidates. Maximal degree in co-relation 3059. Up to 772 conditions per place. [2022-12-13 11:53:56,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 56 transitions, 281 flow [2022-12-13 11:53:56,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 906 [2022-12-13 11:53:56,793 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:53:56,795 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 11:53:56,795 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 56 transitions, 281 flow [2022-12-13 11:53:56,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:56,796 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:56,796 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:56,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:53:56,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:56,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:56,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1899725907, now seen corresponding path program 1 times [2022-12-13 11:53:56,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:56,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143879559] [2022-12-13 11:53:56,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:56,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:57,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:57,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143879559] [2022-12-13 11:53:57,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143879559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:57,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:57,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:53:57,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365563070] [2022-12-13 11:53:57,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:57,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:53:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:53:57,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:53:57,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:53:57,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 56 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:57,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:57,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:53:57,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:57,678 INFO L130 PetriNetUnfolder]: 2997/5437 cut-off events. [2022-12-13 11:53:57,678 INFO L131 PetriNetUnfolder]: For 3444/3993 co-relation queries the response was YES. [2022-12-13 11:53:57,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18262 conditions, 5437 events. 2997/5437 cut-off events. For 3444/3993 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 38853 event pairs, 378 based on Foata normal form. 380/4940 useless extension candidates. Maximal degree in co-relation 18246. Up to 2865 conditions per place. [2022-12-13 11:53:57,702 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 126 selfloop transitions, 31 changer transitions 15/186 dead transitions. [2022-12-13 11:53:57,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 186 transitions, 1279 flow [2022-12-13 11:53:57,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:53:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:53:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2022-12-13 11:53:57,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7705627705627706 [2022-12-13 11:53:57,704 INFO L175 Difference]: Start difference. First operand has 49 places, 56 transitions, 281 flow. Second operand 7 states and 178 transitions. [2022-12-13 11:53:57,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 186 transitions, 1279 flow [2022-12-13 11:53:57,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 186 transitions, 1137 flow, removed 35 selfloop flow, removed 2 redundant places. [2022-12-13 11:53:57,709 INFO L231 Difference]: Finished difference. Result has 56 places, 84 transitions, 439 flow [2022-12-13 11:53:57,709 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=439, PETRI_PLACES=56, PETRI_TRANSITIONS=84} [2022-12-13 11:53:57,710 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -22 predicate places. [2022-12-13 11:53:57,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:57,710 INFO L89 Accepts]: Start accepts. Operand has 56 places, 84 transitions, 439 flow [2022-12-13 11:53:57,711 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:57,711 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:57,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 84 transitions, 439 flow [2022-12-13 11:53:57,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 84 transitions, 439 flow [2022-12-13 11:53:57,866 INFO L130 PetriNetUnfolder]: 1366/3002 cut-off events. [2022-12-13 11:53:57,866 INFO L131 PetriNetUnfolder]: For 1096/1592 co-relation queries the response was YES. [2022-12-13 11:53:57,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8048 conditions, 3002 events. 1366/3002 cut-off events. For 1096/1592 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 25579 event pairs, 192 based on Foata normal form. 29/1785 useless extension candidates. Maximal degree in co-relation 8032. Up to 1873 conditions per place. [2022-12-13 11:53:57,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 84 transitions, 439 flow [2022-12-13 11:53:57,885 INFO L226 LiptonReduction]: Number of co-enabled transitions 1448 [2022-12-13 11:53:58,048 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:53:58,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 338 [2022-12-13 11:53:58,048 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 83 transitions, 437 flow [2022-12-13 11:53:58,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:58,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:58,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:58,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:53:58,049 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:58,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash 679353618, now seen corresponding path program 1 times [2022-12-13 11:53:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:58,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928772770] [2022-12-13 11:53:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:58,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:58,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928772770] [2022-12-13 11:53:58,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928772770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:58,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:58,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:53:58,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058609850] [2022-12-13 11:53:58,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:58,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:53:58,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:58,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:53:58,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:53:58,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 11:53:58,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 83 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:58,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:58,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 11:53:58,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:58,486 INFO L130 PetriNetUnfolder]: 1748/3233 cut-off events. [2022-12-13 11:53:58,486 INFO L131 PetriNetUnfolder]: For 2514/2684 co-relation queries the response was YES. [2022-12-13 11:53:58,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11061 conditions, 3233 events. 1748/3233 cut-off events. For 2514/2684 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 21170 event pairs, 69 based on Foata normal form. 530/2600 useless extension candidates. Maximal degree in co-relation 11042. Up to 1297 conditions per place. [2022-12-13 11:53:58,498 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 76 selfloop transitions, 28 changer transitions 14/134 dead transitions. [2022-12-13 11:53:58,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 134 transitions, 919 flow [2022-12-13 11:53:58,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:53:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:53:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 11:53:58,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2022-12-13 11:53:58,500 INFO L175 Difference]: Start difference. First operand has 56 places, 83 transitions, 437 flow. Second operand 5 states and 105 transitions. [2022-12-13 11:53:58,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 134 transitions, 919 flow [2022-12-13 11:53:58,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 134 transitions, 912 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 11:53:58,507 INFO L231 Difference]: Finished difference. Result has 60 places, 78 transitions, 476 flow [2022-12-13 11:53:58,507 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=60, PETRI_TRANSITIONS=78} [2022-12-13 11:53:58,507 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -18 predicate places. [2022-12-13 11:53:58,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:58,507 INFO L89 Accepts]: Start accepts. Operand has 60 places, 78 transitions, 476 flow [2022-12-13 11:53:58,509 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:58,509 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:58,510 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 78 transitions, 476 flow [2022-12-13 11:53:58,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 78 transitions, 476 flow [2022-12-13 11:53:58,570 INFO L130 PetriNetUnfolder]: 598/1297 cut-off events. [2022-12-13 11:53:58,570 INFO L131 PetriNetUnfolder]: For 720/1213 co-relation queries the response was YES. [2022-12-13 11:53:58,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 1297 events. 598/1297 cut-off events. For 720/1213 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 9039 event pairs, 1 based on Foata normal form. 2/630 useless extension candidates. Maximal degree in co-relation 4542. Up to 838 conditions per place. [2022-12-13 11:53:58,579 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 78 transitions, 476 flow [2022-12-13 11:53:58,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 1198 [2022-12-13 11:53:59,131 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:53:59,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 625 [2022-12-13 11:53:59,132 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 76 transitions, 482 flow [2022-12-13 11:53:59,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:59,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:59,132 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:59,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:53:59,132 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:59,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:59,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1691156774, now seen corresponding path program 1 times [2022-12-13 11:53:59,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:59,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877753795] [2022-12-13 11:53:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:59,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:59,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:59,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877753795] [2022-12-13 11:53:59,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877753795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:59,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:59,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:53:59,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212831576] [2022-12-13 11:53:59,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:59,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:53:59,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:59,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:53:59,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:53:59,302 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 11:53:59,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 76 transitions, 482 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:59,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:59,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 11:53:59,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:59,573 INFO L130 PetriNetUnfolder]: 1902/3457 cut-off events. [2022-12-13 11:53:59,573 INFO L131 PetriNetUnfolder]: For 6742/7153 co-relation queries the response was YES. [2022-12-13 11:53:59,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13940 conditions, 3457 events. 1902/3457 cut-off events. For 6742/7153 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 23365 event pairs, 277 based on Foata normal form. 251/2972 useless extension candidates. Maximal degree in co-relation 13919. Up to 1477 conditions per place. [2022-12-13 11:53:59,588 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 54 selfloop transitions, 1 changer transitions 67/141 dead transitions. [2022-12-13 11:53:59,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 141 transitions, 1120 flow [2022-12-13 11:53:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:53:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:53:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 11:53:59,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 11:53:59,589 INFO L175 Difference]: Start difference. First operand has 58 places, 76 transitions, 482 flow. Second operand 4 states and 88 transitions. [2022-12-13 11:53:59,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 141 transitions, 1120 flow [2022-12-13 11:53:59,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 141 transitions, 967 flow, removed 31 selfloop flow, removed 4 redundant places. [2022-12-13 11:53:59,662 INFO L231 Difference]: Finished difference. Result has 59 places, 66 transitions, 351 flow [2022-12-13 11:53:59,662 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=59, PETRI_TRANSITIONS=66} [2022-12-13 11:53:59,662 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -19 predicate places. [2022-12-13 11:53:59,662 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:59,663 INFO L89 Accepts]: Start accepts. Operand has 59 places, 66 transitions, 351 flow [2022-12-13 11:53:59,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:59,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:59,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 66 transitions, 351 flow [2022-12-13 11:53:59,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 66 transitions, 351 flow [2022-12-13 11:53:59,695 INFO L130 PetriNetUnfolder]: 274/659 cut-off events. [2022-12-13 11:53:59,696 INFO L131 PetriNetUnfolder]: For 719/819 co-relation queries the response was YES. [2022-12-13 11:53:59,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 659 events. 274/659 cut-off events. For 719/819 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 4353 event pairs, 0 based on Foata normal form. 11/280 useless extension candidates. Maximal degree in co-relation 1892. Up to 298 conditions per place. [2022-12-13 11:53:59,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 66 transitions, 351 flow [2022-12-13 11:53:59,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-13 11:53:59,745 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:53:59,746 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-13 11:53:59,746 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 65 transitions, 352 flow [2022-12-13 11:53:59,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:59,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:59,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:59,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:53:59,747 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:59,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:59,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1898963547, now seen corresponding path program 1 times [2022-12-13 11:53:59,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:59,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289738551] [2022-12-13 11:53:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:59,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:54:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:54:00,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:54:00,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289738551] [2022-12-13 11:54:00,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289738551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:54:00,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:54:00,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:54:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270669672] [2022-12-13 11:54:00,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:54:00,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:54:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:54:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:54:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:54:00,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 11:54:00,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 65 transitions, 352 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:54:00,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:54:00,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 11:54:00,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:54:00,528 INFO L130 PetriNetUnfolder]: 687/1338 cut-off events. [2022-12-13 11:54:00,529 INFO L131 PetriNetUnfolder]: For 2464/2583 co-relation queries the response was YES. [2022-12-13 11:54:00,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4818 conditions, 1338 events. 687/1338 cut-off events. For 2464/2583 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8087 event pairs, 56 based on Foata normal form. 95/1097 useless extension candidates. Maximal degree in co-relation 4797. Up to 652 conditions per place. [2022-12-13 11:54:00,533 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 50 selfloop transitions, 5 changer transitions 40/111 dead transitions. [2022-12-13 11:54:00,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 766 flow [2022-12-13 11:54:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:54:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:54:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-13 11:54:00,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-13 11:54:00,535 INFO L175 Difference]: Start difference. First operand has 56 places, 65 transitions, 352 flow. Second operand 6 states and 104 transitions. [2022-12-13 11:54:00,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 766 flow [2022-12-13 11:54:00,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 747 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 11:54:00,546 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 313 flow [2022-12-13 11:54:00,546 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2022-12-13 11:54:00,547 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -19 predicate places. [2022-12-13 11:54:00,547 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:54:00,547 INFO L89 Accepts]: Start accepts. Operand has 59 places, 56 transitions, 313 flow [2022-12-13 11:54:00,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:54:00,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:54:00,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 56 transitions, 313 flow [2022-12-13 11:54:00,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 313 flow [2022-12-13 11:54:00,574 INFO L130 PetriNetUnfolder]: 250/595 cut-off events. [2022-12-13 11:54:00,574 INFO L131 PetriNetUnfolder]: For 694/723 co-relation queries the response was YES. [2022-12-13 11:54:00,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1779 conditions, 595 events. 250/595 cut-off events. For 694/723 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 3923 event pairs, 0 based on Foata normal form. 4/263 useless extension candidates. Maximal degree in co-relation 1761. Up to 280 conditions per place. [2022-12-13 11:54:00,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 56 transitions, 313 flow [2022-12-13 11:54:00,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 420 [2022-12-13 11:54:01,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [519] L760-->L770: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_123 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_454 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_171 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff0_used~0_455 256) 0)) .cse5)) (.cse0 (and .cse4 .cse5)) (.cse2 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_396 256) 0))))) (and (= (ite .cse0 0 v_~a$r_buff0_thd1~0_171) v_~a$r_buff0_thd1~0_170) (= v_~__unbuffered_cnt~0_489 (+ v_~__unbuffered_cnt~0_490 1)) (= (ite .cse1 v_~a$w_buff0~0_243 (ite .cse2 v_~a$w_buff1~0_213 v_~a~0_331)) v_~a~0_330) (= v_~a$w_buff0_used~0_454 (ite .cse1 0 v_~a$w_buff0_used~0_455)) (= v_~a$r_buff1_thd1~0_122 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_395 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_170 256) 0)))) 0 v_~a$r_buff1_thd1~0_123)) (= (ite (or .cse0 .cse2) 0 v_~a$w_buff1_used~0_396) v_~a$w_buff1_used~0_395)))) InVars {~a~0=v_~a~0_331, ~a$w_buff1~0=v_~a$w_buff1~0_213, ~a$w_buff0~0=v_~a$w_buff0~0_243, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_123, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_490, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_171, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_396} OutVars{~a~0=v_~a~0_330, ~a$w_buff1~0=v_~a$w_buff1~0_213, ~a$w_buff0~0=v_~a$w_buff0~0_243, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_122, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_454, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_489, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_170, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_395} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~__unbuffered_cnt~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [510] L848-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~a$r_buff1_thd0~0_121 256) 0))) (.cse2 (not (= (mod v_~a$w_buff0_used~0_398 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_115 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_399 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_342 256) 0))))) (and (= (mod v_~main$tmp_guard1~0_114 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_97|) (= v_~a$r_buff0_thd0~0_114 (ite .cse0 0 v_~a$r_buff0_thd0~0_115)) (= (ite (or (and .cse1 (not (= (mod v_~a$w_buff1_used~0_341 256) 0))) (and .cse2 (not (= (mod v_~a$r_buff0_thd0~0_114 256) 0)))) 0 v_~a$r_buff1_thd0~0_121) v_~a$r_buff1_thd0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_103| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_97|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_103| 0) (= v_~main$tmp_guard0~0_100 (ite (= (ite (= v_~__unbuffered_cnt~0_473 3) 1 0) 0) 0 1)) (= (ite (or .cse3 .cse0) 0 v_~a$w_buff1_used~0_342) v_~a$w_buff1_used~0_341) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| 0)) (= (ite .cse4 0 v_~a$w_buff0_used~0_399) v_~a$w_buff0_used~0_398) (= v_~a~0_276 (ite .cse4 v_~a$w_buff0~0_215 (ite .cse3 v_~a$w_buff1~0_187 v_~a~0_277))) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_114 1) (= v_~__unbuffered_p0_EAX~0_124 0) (= v_~__unbuffered_p2_EBX~0_128 0) (= v_~y~0_155 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_114)))) InVars {~a~0=v_~a~0_277, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_124, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_128, ~a$w_buff1~0=v_~a$w_buff1~0_187, ~a$w_buff0~0=v_~a$w_buff0~0_215, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_121, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_399, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_473, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_115, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_342, ~y~0=v_~y~0_155} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_103|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_128, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_81|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_95|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_398, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_114, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_114, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~a~0=v_~a~0_276, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_124, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_97|, ~a$w_buff1~0=v_~a$w_buff1~0_187, ~a$w_buff0~0=v_~a$w_buff0~0_215, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_73|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_120, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_473, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_341, ~y~0=v_~y~0_155, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:54:02,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [520] L760-->P0FINAL: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd1~0_127 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_458 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_175 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_400 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_459 256) 0))))) (and (= v_~__unbuffered_cnt~0_493 (+ v_~__unbuffered_cnt~0_494 1)) (= (ite .cse0 0 v_~a$r_buff0_thd1~0_175) v_~a$r_buff0_thd1~0_174) (= |v_P0Thread1of1ForFork1_#res#1.offset_69| 0) (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_400) v_~a$w_buff1_used~0_399) (= v_~a~0_334 (ite .cse2 v_~a$w_buff0~0_245 (ite .cse1 v_~a$w_buff1~0_215 v_~a~0_335))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_174 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$w_buff1_used~0_399 256) 0)))) 0 v_~a$r_buff1_thd1~0_127) v_~a$r_buff1_thd1~0_126) (= |v_P0Thread1of1ForFork1_#res#1.base_69| 0) (= (ite .cse2 0 v_~a$w_buff0_used~0_459) v_~a$w_buff0_used~0_458)))) InVars {~a~0=v_~a~0_335, ~a$w_buff1~0=v_~a$w_buff1~0_215, ~a$w_buff0~0=v_~a$w_buff0~0_245, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_127, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_459, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_494, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_175, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_400} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_69|, ~a~0=v_~a~0_334, ~a$w_buff1~0=v_~a$w_buff1~0_215, ~a$w_buff0~0=v_~a$w_buff0~0_245, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_126, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_69|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_458, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_493, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_174, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_399} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, ~a~0, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res#1.base, ~a$w_buff0_used~0, ~__unbuffered_cnt~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [510] L848-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~a$r_buff1_thd0~0_121 256) 0))) (.cse2 (not (= (mod v_~a$w_buff0_used~0_398 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_115 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_399 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_342 256) 0))))) (and (= (mod v_~main$tmp_guard1~0_114 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_97|) (= v_~a$r_buff0_thd0~0_114 (ite .cse0 0 v_~a$r_buff0_thd0~0_115)) (= (ite (or (and .cse1 (not (= (mod v_~a$w_buff1_used~0_341 256) 0))) (and .cse2 (not (= (mod v_~a$r_buff0_thd0~0_114 256) 0)))) 0 v_~a$r_buff1_thd0~0_121) v_~a$r_buff1_thd0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_103| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_97|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_103| 0) (= v_~main$tmp_guard0~0_100 (ite (= (ite (= v_~__unbuffered_cnt~0_473 3) 1 0) 0) 0 1)) (= (ite (or .cse3 .cse0) 0 v_~a$w_buff1_used~0_342) v_~a$w_buff1_used~0_341) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| 0)) (= (ite .cse4 0 v_~a$w_buff0_used~0_399) v_~a$w_buff0_used~0_398) (= v_~a~0_276 (ite .cse4 v_~a$w_buff0~0_215 (ite .cse3 v_~a$w_buff1~0_187 v_~a~0_277))) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_114 1) (= v_~__unbuffered_p0_EAX~0_124 0) (= v_~__unbuffered_p2_EBX~0_128 0) (= v_~y~0_155 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_114)))) InVars {~a~0=v_~a~0_277, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_124, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_128, ~a$w_buff1~0=v_~a$w_buff1~0_187, ~a$w_buff0~0=v_~a$w_buff0~0_215, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_121, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_399, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_473, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_115, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_342, ~y~0=v_~y~0_155} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_103|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_128, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_81|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_95|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_398, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_114, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_114, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~a~0=v_~a~0_276, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_124, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_97|, ~a$w_buff1~0=v_~a$w_buff1~0_187, ~a$w_buff0~0=v_~a$w_buff0~0_215, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_73|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_120, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_473, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_341, ~y~0=v_~y~0_155, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:54:02,329 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [521] L760-->P0EXIT: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd1~0_131 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_179 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_462 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= 0 (mod v_~a$w_buff1_used~0_404 256))))) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_463 256) 0)) .cse5))) (and (= v_~__unbuffered_cnt~0_497 (+ v_~__unbuffered_cnt~0_498 1)) (= (ite .cse0 0 v_~a$r_buff0_thd1~0_179) v_~a$r_buff0_thd1~0_178) (= (ite (or .cse1 .cse0) 0 v_~a$w_buff1_used~0_404) v_~a$w_buff1_used~0_403) (= |v_P0Thread1of1ForFork1_#res#1.offset_71| 0) (= (ite .cse2 v_~a$w_buff0~0_247 (ite .cse1 v_~a$w_buff1~0_217 v_~a~0_339)) v_~a~0_338) (= v_~a$r_buff1_thd1~0_130 (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_178 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_403 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_131)) (= |v_P0Thread1of1ForFork1_#res#1.base_71| 0) (= v_~a$w_buff0_used~0_462 (ite .cse2 0 v_~a$w_buff0_used~0_463))))) InVars {~a~0=v_~a~0_339, ~a$w_buff1~0=v_~a$w_buff1~0_217, ~a$w_buff0~0=v_~a$w_buff0~0_247, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_131, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_463, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_498, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_179, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_404} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_71|, ~a~0=v_~a~0_338, ~a$w_buff1~0=v_~a$w_buff1~0_217, ~a$w_buff0~0=v_~a$w_buff0~0_247, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_130, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_71|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_462, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_497, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_178, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_403} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, ~a~0, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res#1.base, ~a$w_buff0_used~0, ~__unbuffered_cnt~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [510] L848-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~a$r_buff1_thd0~0_121 256) 0))) (.cse2 (not (= (mod v_~a$w_buff0_used~0_398 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_115 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_399 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_342 256) 0))))) (and (= (mod v_~main$tmp_guard1~0_114 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_97|) (= v_~a$r_buff0_thd0~0_114 (ite .cse0 0 v_~a$r_buff0_thd0~0_115)) (= (ite (or (and .cse1 (not (= (mod v_~a$w_buff1_used~0_341 256) 0))) (and .cse2 (not (= (mod v_~a$r_buff0_thd0~0_114 256) 0)))) 0 v_~a$r_buff1_thd0~0_121) v_~a$r_buff1_thd0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_103| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_97|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_103| 0) (= v_~main$tmp_guard0~0_100 (ite (= (ite (= v_~__unbuffered_cnt~0_473 3) 1 0) 0) 0 1)) (= (ite (or .cse3 .cse0) 0 v_~a$w_buff1_used~0_342) v_~a$w_buff1_used~0_341) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| 0)) (= (ite .cse4 0 v_~a$w_buff0_used~0_399) v_~a$w_buff0_used~0_398) (= v_~a~0_276 (ite .cse4 v_~a$w_buff0~0_215 (ite .cse3 v_~a$w_buff1~0_187 v_~a~0_277))) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_114 1) (= v_~__unbuffered_p0_EAX~0_124 0) (= v_~__unbuffered_p2_EBX~0_128 0) (= v_~y~0_155 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_114)))) InVars {~a~0=v_~a~0_277, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_124, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_128, ~a$w_buff1~0=v_~a$w_buff1~0_187, ~a$w_buff0~0=v_~a$w_buff0~0_215, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_121, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_399, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_473, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_115, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_342, ~y~0=v_~y~0_155} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_103|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_128, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_81|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_95|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_398, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_114, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_114, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~a~0=v_~a~0_276, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_124, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_97|, ~a$w_buff1~0=v_~a$w_buff1~0_187, ~a$w_buff0~0=v_~a$w_buff0~0_215, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_73|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_120, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_473, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_341, ~y~0=v_~y~0_155, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:54:02,735 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:54:02,736 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2189 [2022-12-13 11:54:02,736 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 366 flow [2022-12-13 11:54:02,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:54:02,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:54:02,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:54:02,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:54:02,737 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:54:02,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:54:02,737 INFO L85 PathProgramCache]: Analyzing trace with hash -242145369, now seen corresponding path program 1 times [2022-12-13 11:54:02,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:54:02,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940869590] [2022-12-13 11:54:02,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:54:02,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:54:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:54:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:54:02,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:54:02,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940869590] [2022-12-13 11:54:02,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940869590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:54:02,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:54:02,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:54:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642132918] [2022-12-13 11:54:02,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:54:02,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:54:02,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:54:02,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:54:02,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:54:02,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-13 11:54:02,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:54:02,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:54:02,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-13 11:54:02,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:54:03,028 INFO L130 PetriNetUnfolder]: 329/861 cut-off events. [2022-12-13 11:54:03,028 INFO L131 PetriNetUnfolder]: For 2491/2521 co-relation queries the response was YES. [2022-12-13 11:54:03,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3596 conditions, 861 events. 329/861 cut-off events. For 2491/2521 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 6241 event pairs, 40 based on Foata normal form. 66/683 useless extension candidates. Maximal degree in co-relation 3575. Up to 398 conditions per place. [2022-12-13 11:54:03,030 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 39 selfloop transitions, 6 changer transitions 27/80 dead transitions. [2022-12-13 11:54:03,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 671 flow [2022-12-13 11:54:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:54:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:54:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-13 11:54:03,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.546875 [2022-12-13 11:54:03,032 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 366 flow. Second operand 4 states and 70 transitions. [2022-12-13 11:54:03,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 671 flow [2022-12-13 11:54:03,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 80 transitions, 607 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 11:54:03,038 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 296 flow [2022-12-13 11:54:03,038 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-13 11:54:03,039 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -25 predicate places. [2022-12-13 11:54:03,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:54:03,039 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 296 flow [2022-12-13 11:54:03,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:54:03,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:54:03,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 296 flow [2022-12-13 11:54:03,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 296 flow [2022-12-13 11:54:03,057 INFO L130 PetriNetUnfolder]: 66/215 cut-off events. [2022-12-13 11:54:03,058 INFO L131 PetriNetUnfolder]: For 706/757 co-relation queries the response was YES. [2022-12-13 11:54:03,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 215 events. 66/215 cut-off events. For 706/757 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 1285 event pairs, 0 based on Foata normal form. 6/105 useless extension candidates. Maximal degree in co-relation 806. Up to 109 conditions per place. [2022-12-13 11:54:03,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 296 flow [2022-12-13 11:54:03,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-13 11:54:37,877 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] $Ultimate##0-->L780: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.base_13| v_P1Thread1of1ForFork2_~arg.base_13) (= v_~x~0_51 1) (= |v_P1Thread1of1ForFork2_#in~arg.offset_13| v_P1Thread1of1ForFork2_~arg.offset_13) (= v_~y~0_159 1)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_13|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_13|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_13|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_13, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_13, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_13|, ~y~0=v_~y~0_159, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~y~0, ~x~0] and [399] $Ultimate##0-->L800: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_13 2) (= v_~z~0_6 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~z~0=v_~z~0_6, ~y~0=v_~y~0_13, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~z~0, ~y~0] [2022-12-13 11:54:37,907 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] $Ultimate##0-->L800: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= v_~y~0_171 2) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_39) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_39) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19) (= v_~z~0_70 1) (= v_~x~0_59 1)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_39, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_39, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~z~0=v_~z~0_70, ~y~0=v_~y~0_171, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, ~x~0=v_~x~0_59} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~z~0, ~y~0, ~x~0] and [342] L780-->L787: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_26 256) 0))) (.cse2 (not (= (mod v_~a$w_buff0_used~0_121 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_103 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_122 256) 0))))) (and (= v_~a$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_103)) (= v_~a$r_buff0_thd2~0_25 (ite .cse1 0 v_~a$r_buff0_thd2~0_26)) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_25 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_102 256) 0)))) 0 v_~a$r_buff1_thd2~0_22) v_~a$r_buff1_thd2~0_21) (= v_~a~0_64 (ite .cse4 v_~a$w_buff0~0_47 (ite .cse0 v_~a$w_buff1~0_50 v_~a~0_65))) (= (ite .cse4 0 v_~a$w_buff0_used~0_122) v_~a$w_buff0_used~0_121)))) InVars {~a~0=v_~a~0_65, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_22, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_26, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_122, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_64, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_21, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_25, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_121, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0] [2022-12-13 11:54:38,013 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:54:38,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34975 [2022-12-13 11:54:38,014 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 294 flow [2022-12-13 11:54:38,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:54:38,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:54:38,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:54:38,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:54:38,014 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:54:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:54:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1002518689, now seen corresponding path program 1 times [2022-12-13 11:54:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:54:38,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551543024] [2022-12-13 11:54:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:54:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:54:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:54:38,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:54:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:54:38,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:54:38,232 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:54:38,233 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:54:38,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:54:38,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:54:38,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:54:38,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:54:38,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:54:38,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:54:38,235 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:54:38,241 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:54:38,241 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:54:38,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:54:38 BasicIcfg [2022-12-13 11:54:38,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:54:38,303 INFO L158 Benchmark]: Toolchain (without parser) took 51742.36ms. Allocated memory was 187.7MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 162.5MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-13 11:54:38,303 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:54:38,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.67ms. Allocated memory is still 187.7MB. Free memory was 162.0MB in the beginning and 135.3MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 11:54:38,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.59ms. Allocated memory is still 187.7MB. Free memory was 135.3MB in the beginning and 133.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:54:38,304 INFO L158 Benchmark]: Boogie Preprocessor took 46.38ms. Allocated memory is still 187.7MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:54:38,304 INFO L158 Benchmark]: RCFGBuilder took 557.49ms. Allocated memory is still 187.7MB. Free memory was 131.1MB in the beginning and 95.9MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-13 11:54:38,304 INFO L158 Benchmark]: TraceAbstraction took 50635.36ms. Allocated memory was 187.7MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 94.9MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-13 11:54:38,305 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.12ms. Allocated memory is still 187.7MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 449.67ms. Allocated memory is still 187.7MB. Free memory was 162.0MB in the beginning and 135.3MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.59ms. Allocated memory is still 187.7MB. Free memory was 135.3MB in the beginning and 133.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.38ms. Allocated memory is still 187.7MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 557.49ms. Allocated memory is still 187.7MB. Free memory was 131.1MB in the beginning and 95.9MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 50635.36ms. Allocated memory was 187.7MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 94.9MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 117 PlacesBefore, 78 PlacesAfterwards, 109 TransitionsBefore, 69 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4400, independent: 4267, independent conditional: 4267, independent unconditional: 0, dependent: 133, dependent conditional: 133, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4400, independent: 4267, independent conditional: 0, independent unconditional: 4267, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4400, independent: 4267, independent conditional: 0, independent unconditional: 4267, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4400, independent: 4267, independent conditional: 0, independent unconditional: 4267, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2213, independent: 2170, independent conditional: 0, independent unconditional: 2170, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2213, independent: 2134, independent conditional: 0, independent unconditional: 2134, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 199, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4400, independent: 2097, independent conditional: 0, independent unconditional: 2097, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 2213, unknown conditional: 0, unknown unconditional: 2213] , Statistics on independence cache: Total cache size (in pairs): 4356, Positive cache size: 4313, Positive conditional cache size: 0, Positive unconditional cache size: 4313, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 283, independent conditional: 283, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 321, independent: 283, independent conditional: 23, independent unconditional: 260, dependent: 38, dependent conditional: 7, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 321, independent: 283, independent conditional: 23, independent unconditional: 260, dependent: 38, dependent conditional: 7, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 321, independent: 283, independent conditional: 23, independent unconditional: 260, dependent: 38, dependent conditional: 7, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 273, independent: 245, independent conditional: 21, independent unconditional: 224, dependent: 28, dependent conditional: 5, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 273, independent: 215, independent conditional: 0, independent unconditional: 215, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 28, dependent conditional: 5, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 159, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 133, dependent conditional: 30, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 321, independent: 38, independent conditional: 2, independent unconditional: 36, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 273, unknown conditional: 26, unknown unconditional: 247] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 245, Positive conditional cache size: 21, Positive unconditional cache size: 224, Negative cache size: 28, Negative conditional cache size: 5, Negative unconditional cache size: 23, 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, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 764 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 238, independent: 209, independent conditional: 209, 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: 238, independent: 209, independent conditional: 19, independent unconditional: 190, dependent: 29, dependent conditional: 2, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 238, independent: 209, independent conditional: 0, independent unconditional: 209, 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: 238, independent: 209, independent conditional: 0, independent unconditional: 209, 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: 35, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 238, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 35, unknown conditional: 0, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 276, Positive conditional cache size: 21, Positive unconditional cache size: 255, Negative cache size: 32, Negative conditional cache size: 5, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, independent: 199, independent conditional: 199, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 229, independent: 199, independent conditional: 0, independent unconditional: 199, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 229, independent: 199, independent conditional: 0, independent unconditional: 199, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 229, independent: 199, independent conditional: 0, independent unconditional: 199, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 229, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 278, Positive conditional cache size: 21, Positive unconditional cache size: 257, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 130, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 28, dependent conditional: 0, dependent unconditional: 28, 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: 102, independent conditional: 0, independent unconditional: 102, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 278, Positive conditional cache size: 21, Positive unconditional cache size: 257, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 906 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 169, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 169, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 169, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 37, dependent conditional: 0, dependent unconditional: 37, 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: 169, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 278, Positive conditional cache size: 21, Positive unconditional cache size: 257, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 56 PlacesBefore, 56 PlacesAfterwards, 84 TransitionsBefore, 83 TransitionsAfterwards, 1448 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 109, independent conditional: 109, 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: 117, independent: 109, independent conditional: 56, independent unconditional: 53, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 117, independent: 109, independent conditional: 39, independent unconditional: 70, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 109, independent conditional: 39, independent unconditional: 70, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 4, independent unconditional: 16, 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: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 117, independent: 89, independent conditional: 35, independent unconditional: 54, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 20, unknown conditional: 4, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 301, Positive conditional cache size: 25, Positive unconditional cache size: 276, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 60 PlacesBefore, 58 PlacesAfterwards, 78 TransitionsBefore, 76 TransitionsAfterwards, 1198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 24, 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: 32, independent: 24, independent conditional: 16, independent unconditional: 8, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 24, independent conditional: 8, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 8, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 32, independent: 24, independent conditional: 8, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 309, Positive conditional cache size: 25, Positive unconditional cache size: 284, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 56 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 56, independent conditional: 34, independent unconditional: 22, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 56, independent conditional: 28, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 56, independent conditional: 28, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 49, independent conditional: 28, independent unconditional: 21, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 356, Positive conditional cache size: 29, Positive unconditional cache size: 327, Negative cache size: 35, Negative conditional cache size: 5, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 54 PlacesBefore, 53 PlacesAfterwards, 56 TransitionsBefore, 52 TransitionsAfterwards, 420 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257, independent: 257, independent conditional: 257, 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: 257, independent: 257, independent conditional: 251, 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: 257, independent: 257, independent conditional: 221, 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: 257, independent: 257, independent conditional: 221, 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: 44, independent: 44, independent conditional: 36, independent unconditional: 8, 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: 44, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, independent: 213, independent conditional: 185, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 44, unknown conditional: 36, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 651, Positive cache size: 616, Positive conditional cache size: 65, Positive unconditional cache size: 551, Negative cache size: 35, Negative conditional cache size: 5, Negative unconditional cache size: 30, 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: 35.0s, 53 PlacesBefore, 50 PlacesAfterwards, 45 TransitionsBefore, 42 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 30, independent unconditional: 2, 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: 32, independent: 32, independent conditional: 20, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 20, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 32, independent: 30, independent conditional: 20, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 694, Positive cache size: 659, Positive conditional cache size: 66, Positive unconditional cache size: 593, Negative cache size: 35, Negative conditional cache size: 5, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1105; [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1105, ((void *)0), P0, ((void *)0))=-3, t1105={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1106; [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1106, ((void *)0), P1, ((void *)0))=-2, t1105={5:0}, t1106={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1107; [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1107, ((void *)0), P2, ((void *)0))=-1, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L776] 2 x = 1 [L779] 2 y = 1 [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L796] 3 y = 2 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L802] 3 __unbuffered_p2_EAX = z [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 1 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 1 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 1 !(!cond) [L852] RET 1 assume_abort_if_not(main$tmp_guard0) [L854] 1 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 1 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 1 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L861] 1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 1 !expression [L18] 1 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 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: 50.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 976 IncrementalHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 20 mSDtfsCounter, 976 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:54:38,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...