/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/mix027_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:49:45,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:49:45,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:49:45,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:49:45,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:49:45,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:49:45,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:49:45,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:49:45,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:49:45,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:49:45,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:49:45,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:49:45,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:49:45,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:49:45,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:49:45,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:49:45,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:49:45,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:49:45,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:49:45,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:49:45,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:49:45,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:49:45,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:49:45,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:49:45,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:49:45,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:49:45,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:49:45,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:49:45,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:49:45,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:49:45,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:49:45,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:49:45,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:49:45,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:49:45,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:49:45,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:49:45,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:49:45,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:49:45,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:49:45,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:49:45,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:49:45,657 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:49:45,689 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:49:45,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:49:45,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:49:45,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:49:45,692 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:49:45,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:49:45,693 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:49:45,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:49:45,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:49:45,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:49:45,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:49:45,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:49:45,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:49:45,694 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:49:45,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:49:45,695 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:49:45,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:49:45,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:49:45,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:49:45,695 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:49:45,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:49:45,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:49:45,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:49:45,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:49:45,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:49:45,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:49:45,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:49:45,697 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:49:45,697 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:49:45,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:49:45,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:49:45,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:49:45,992 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:49:45,992 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:49:45,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2022-12-13 11:49:47,167 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:49:47,431 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:49:47,431 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2022-12-13 11:49:47,453 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942330ac7/74f18368e7544eec80267d5d4668bb1d/FLAGb6ac708c9 [2022-12-13 11:49:47,466 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942330ac7/74f18368e7544eec80267d5d4668bb1d [2022-12-13 11:49:47,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:49:47,469 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:49:47,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:49:47,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:49:47,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:49:47,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:49:47" (1/1) ... [2022-12-13 11:49:47,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5b836f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47, skipping insertion in model container [2022-12-13 11:49:47,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:49:47" (1/1) ... [2022-12-13 11:49:47,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:49:47,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:49:47,655 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/mix027_tso.i[944,957] [2022-12-13 11:49:47,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:49:47,899 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:49:47,909 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/mix027_tso.i[944,957] [2022-12-13 11:49:47,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:47,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:47,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:49:47,994 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:49:47,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47 WrapperNode [2022-12-13 11:49:47,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:49:47,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:49:47,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:49:47,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:49:48,002 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:49:47" (1/1) ... [2022-12-13 11:49:48,025 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:49:47" (1/1) ... [2022-12-13 11:49:48,051 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-13 11:49:48,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:49:48,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:49:48,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:49:48,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:49:48,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47" (1/1) ... [2022-12-13 11:49:48,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47" (1/1) ... [2022-12-13 11:49:48,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47" (1/1) ... [2022-12-13 11:49:48,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47" (1/1) ... [2022-12-13 11:49:48,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47" (1/1) ... [2022-12-13 11:49:48,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47" (1/1) ... [2022-12-13 11:49:48,093 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47" (1/1) ... [2022-12-13 11:49:48,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47" (1/1) ... [2022-12-13 11:49:48,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:49:48,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:49:48,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:49:48,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:49:48,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47" (1/1) ... [2022-12-13 11:49:48,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:49:48,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:49:48,140 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:49:48,163 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:49:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:49:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:49:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:49:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:49:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:49:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:49:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:49:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:49:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:49:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:49:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:49:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:49:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:49:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:49:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:49:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:49:48,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:49:48,181 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:49:48,333 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:49:48,335 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:49:48,625 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:49:48,807 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:49:48,807 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:49:48,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:49:48 BoogieIcfgContainer [2022-12-13 11:49:48,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:49:48,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:49:48,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:49:48,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:49:48,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:49:47" (1/3) ... [2022-12-13 11:49:48,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac3b12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:49:48, skipping insertion in model container [2022-12-13 11:49:48,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:47" (2/3) ... [2022-12-13 11:49:48,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac3b12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:49:48, skipping insertion in model container [2022-12-13 11:49:48,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:49:48" (3/3) ... [2022-12-13 11:49:48,816 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2022-12-13 11:49:48,833 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:49:48,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:49:48,833 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:49:48,900 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:49:48,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 11:49:49,019 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 11:49:49,019 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:49:49,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-13 11:49:49,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 11:49:49,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-13 11:49:49,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:49,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 11:49:49,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-13 11:49:49,076 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 11:49:49,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:49:49,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-13 11:49:49,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 11:49:49,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 3150 [2022-12-13 11:49:58,843 INFO L241 LiptonReduction]: Total number of compositions: 97 [2022-12-13 11:49:58,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:49:58,862 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;@7a33e72f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:49:58,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 11:49:58,866 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-13 11:49:58,866 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:49:58,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:58,867 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:49:58,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:49:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash 548227242, now seen corresponding path program 1 times [2022-12-13 11:49:58,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:58,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688880394] [2022-12-13 11:49:58,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:58,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,266 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:49:59,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:59,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688880394] [2022-12-13 11:49:59,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688880394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:59,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:59,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:49:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004215034] [2022-12-13 11:49:59,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:59,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:59,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:59,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:59,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:49:59,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 79 [2022-12-13 11:49:59,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:49:59,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:59,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 79 [2022-12-13 11:49:59,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:07,768 INFO L130 PetriNetUnfolder]: 57424/83347 cut-off events. [2022-12-13 11:50:07,768 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-13 11:50:07,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159500 conditions, 83347 events. 57424/83347 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 4139. Compared 665146 event pairs, 8548 based on Foata normal form. 0/52874 useless extension candidates. Maximal degree in co-relation 159488. Up to 63597 conditions per place. [2022-12-13 11:50:08,023 INFO L137 encePairwiseOnDemand]: 73/79 looper letters, 44 selfloop transitions, 2 changer transitions 64/126 dead transitions. [2022-12-13 11:50:08,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 126 transitions, 490 flow [2022-12-13 11:50:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:50:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:50:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-12-13 11:50:08,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6962025316455697 [2022-12-13 11:50:08,035 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 170 flow. Second operand 3 states and 165 transitions. [2022-12-13 11:50:08,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 126 transitions, 490 flow [2022-12-13 11:50:08,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 126 transitions, 484 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:50:08,041 INFO L231 Difference]: Finished difference. Result has 86 places, 43 transitions, 98 flow [2022-12-13 11:50:08,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=86, PETRI_TRANSITIONS=43} [2022-12-13 11:50:08,045 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2022-12-13 11:50:08,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:08,046 INFO L89 Accepts]: Start accepts. Operand has 86 places, 43 transitions, 98 flow [2022-12-13 11:50:08,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:08,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:08,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 43 transitions, 98 flow [2022-12-13 11:50:08,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2022-12-13 11:50:08,057 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-12-13 11:50:08,057 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:50:08,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 113 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:50:08,061 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2022-12-13 11:50:08,061 INFO L226 LiptonReduction]: Number of co-enabled transitions 1100 [2022-12-13 11:50:08,203 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:08,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-13 11:50:08,205 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 98 flow [2022-12-13 11:50:08,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:50:08,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:08,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:08,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:50:08,209 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:08,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1386194387, now seen corresponding path program 1 times [2022-12-13 11:50:08,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:08,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054989349] [2022-12-13 11:50:08,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:08,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:08,692 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:50:08,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:08,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054989349] [2022-12-13 11:50:08,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054989349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:08,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:08,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:50:08,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250400852] [2022-12-13 11:50:08,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:08,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:50:08,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:08,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:50:08,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:50:08,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 11:50:08,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 98 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:50:08,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:08,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 11:50:08,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:11,070 INFO L130 PetriNetUnfolder]: 20627/28503 cut-off events. [2022-12-13 11:50:11,070 INFO L131 PetriNetUnfolder]: For 1138/1138 co-relation queries the response was YES. [2022-12-13 11:50:11,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57645 conditions, 28503 events. 20627/28503 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 156803 event pairs, 5531 based on Foata normal form. 612/24817 useless extension candidates. Maximal degree in co-relation 57635. Up to 19093 conditions per place. [2022-12-13 11:50:11,259 INFO L137 encePairwiseOnDemand]: 31/43 looper letters, 55 selfloop transitions, 11 changer transitions 0/77 dead transitions. [2022-12-13 11:50:11,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 77 transitions, 302 flow [2022-12-13 11:50:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:50:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:50:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-13 11:50:11,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2022-12-13 11:50:11,264 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 98 flow. Second operand 4 states and 112 transitions. [2022-12-13 11:50:11,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 77 transitions, 302 flow [2022-12-13 11:50:11,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:50:11,268 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 178 flow [2022-12-13 11:50:11,269 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2022-12-13 11:50:11,269 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -33 predicate places. [2022-12-13 11:50:11,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:11,270 INFO L89 Accepts]: Start accepts. Operand has 58 places, 52 transitions, 178 flow [2022-12-13 11:50:11,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:11,271 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:11,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 52 transitions, 178 flow [2022-12-13 11:50:11,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 178 flow [2022-12-13 11:50:11,507 INFO L130 PetriNetUnfolder]: 721/1301 cut-off events. [2022-12-13 11:50:11,507 INFO L131 PetriNetUnfolder]: For 137/155 co-relation queries the response was YES. [2022-12-13 11:50:11,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 1301 events. 721/1301 cut-off events. For 137/155 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 8111 event pairs, 417 based on Foata normal form. 0/1072 useless extension candidates. Maximal degree in co-relation 2727. Up to 952 conditions per place. [2022-12-13 11:50:11,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 52 transitions, 178 flow [2022-12-13 11:50:11,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 1236 [2022-12-13 11:50:11,704 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L801-->L804: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [270] L863-->L869: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_60 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_143 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_66 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256))))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_144 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_66) v_~x$r_buff0_thd0~0_65) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x~0_95 (ite .cse2 v_~x$w_buff0~0_62 (ite .cse1 v_~x$w_buff1~0_61 v_~x~0_96))) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd0~0_65 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_60) v_~x$r_buff1_thd0~0_59) (= (ite .cse2 0 v_~x$w_buff0_used~0_144) v_~x$w_buff0_used~0_143)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_62, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_60, ~x~0=v_~x~0_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_144} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_62, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_65, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_59, ~x~0=v_~x~0_95, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_143} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:50:11,781 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L801-->L804: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [386] L784-->L791: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_33 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_124 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_111 256) 0))))) (and (= v_~x~0_77 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_47 v_~x~0_78))) (= (ite .cse0 0 v_~x$w_buff0_used~0_124) v_~x$w_buff0_used~0_123) (= v_~x$r_buff0_thd2~0_32 (ite .cse2 0 v_~x$r_buff0_thd2~0_33)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_32 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18) v_~x$r_buff1_thd2~0_17) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_33, ~x~0=v_~x~0_78, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_32, ~x~0=v_~x~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:50:11,860 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L801-->L804: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [551] $Ultimate##0-->L781: Formula: (and (= v_~x$w_buff0_used~0_364 v_~x$w_buff1_used~0_333) (= v_~x$r_buff1_thd4~0_63 v_~x$r_buff0_thd4~0_69) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_363 256) 0)) (not (= (mod v_~x$w_buff1_used~0_333 256) 0)))) 1 0)) (= v_~x$r_buff1_thd1~0_63 v_~x$r_buff0_thd1~0_67) (= v_~x$r_buff0_thd2~0_90 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_15|) (= v_~x$w_buff0_used~0_363 1) (= v_~x$w_buff0~0_245 v_~x$w_buff1~0_228) (= v_~x$r_buff1_thd2~0_57 v_~x$r_buff0_thd2~0_91) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= 2 v_~x$w_buff0~0_244) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$r_buff0_thd0~0_236 v_~x$r_buff1_thd0~0_236) (= v_~x$r_buff1_thd3~0_61 v_~x$r_buff0_thd3~0_69)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_245, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_236, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_69, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_91, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_364, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_244, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_236, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_228, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_333, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_63, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_69, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_90, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_236, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_363, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_15|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-13 11:50:11,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L801-->L804: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [378] L754-->L761: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_155 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_140 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x~0_107 (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_69 v_~x~0_108))) (= (ite .cse4 0 v_~x$r_buff0_thd1~0_24) v_~x$r_buff0_thd1~0_23) (= v_~x$w_buff0_used~0_155 (ite .cse2 0 v_~x$w_buff0_used~0_156)) (= v_~x$w_buff1_used~0_140 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:50:12,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L801-->L804: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [400] L824-->L827: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] [2022-12-13 11:50:12,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L801-->L804: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [401] L827-->L834: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_147 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= 0 (mod v_~x$w_buff0_used~0_148 256))) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_133 256) 0)) .cse3)) (.cse0 (and .cse2 .cse5))) (and (= v_~x$r_buff0_thd4~0_23 (ite .cse0 0 v_~x$r_buff0_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_148) v_~x$w_buff0_used~0_147) (= v_~x$r_buff1_thd4~0_21 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_22)) (= v_~x~0_99 (ite .cse1 v_~x$w_buff0~0_64 (ite .cse4 v_~x$w_buff1~0_63 v_~x~0_100))) (= v_~x$w_buff1_used~0_132 (ite (or .cse4 .cse0) 0 v_~x$w_buff1_used~0_133))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_100, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_148} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_99, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_147} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-13 11:50:12,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L801-->L804: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [385] L781-->L784: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 11:50:12,129 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:50:12,130 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 860 [2022-12-13 11:50:12,130 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 186 flow [2022-12-13 11:50:12,131 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:50:12,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:12,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:12,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:50:12,131 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash -755189712, now seen corresponding path program 1 times [2022-12-13 11:50:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:12,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359454428] [2022-12-13 11:50:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:12,457 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:50:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:12,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359454428] [2022-12-13 11:50:12,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359454428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:12,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:12,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:50:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052738110] [2022-12-13 11:50:12,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:12,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:50:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:12,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:50:12,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:50:12,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51 [2022-12-13 11:50:12,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:50:12,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:12,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51 [2022-12-13 11:50:12,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:14,321 INFO L130 PetriNetUnfolder]: 16403/23134 cut-off events. [2022-12-13 11:50:14,322 INFO L131 PetriNetUnfolder]: For 11791/12334 co-relation queries the response was YES. [2022-12-13 11:50:14,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58419 conditions, 23134 events. 16403/23134 cut-off events. For 11791/12334 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 140055 event pairs, 5910 based on Foata normal form. 72/19272 useless extension candidates. Maximal degree in co-relation 58406. Up to 19913 conditions per place. [2022-12-13 11:50:14,499 INFO L137 encePairwiseOnDemand]: 46/51 looper letters, 56 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2022-12-13 11:50:14,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 396 flow [2022-12-13 11:50:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:50:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:50:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-12-13 11:50:14,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6928104575163399 [2022-12-13 11:50:14,500 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 186 flow. Second operand 3 states and 106 transitions. [2022-12-13 11:50:14,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 396 flow [2022-12-13 11:50:14,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:50:14,505 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 218 flow [2022-12-13 11:50:14,505 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2022-12-13 11:50:14,506 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -32 predicate places. [2022-12-13 11:50:14,506 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:14,506 INFO L89 Accepts]: Start accepts. Operand has 59 places, 54 transitions, 218 flow [2022-12-13 11:50:14,507 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:14,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:14,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 54 transitions, 218 flow [2022-12-13 11:50:14,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 218 flow [2022-12-13 11:50:14,679 INFO L130 PetriNetUnfolder]: 980/1809 cut-off events. [2022-12-13 11:50:14,679 INFO L131 PetriNetUnfolder]: For 1205/1451 co-relation queries the response was YES. [2022-12-13 11:50:14,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4021 conditions, 1809 events. 980/1809 cut-off events. For 1205/1451 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 12323 event pairs, 520 based on Foata normal form. 0/1375 useless extension candidates. Maximal degree in co-relation 4009. Up to 1269 conditions per place. [2022-12-13 11:50:14,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 54 transitions, 218 flow [2022-12-13 11:50:14,699 INFO L226 LiptonReduction]: Number of co-enabled transitions 1306 [2022-12-13 11:50:14,706 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:14,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-13 11:50:14,708 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 218 flow [2022-12-13 11:50:14,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:50:14,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:14,708 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:50:14,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:50:14,708 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:14,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:14,709 INFO L85 PathProgramCache]: Analyzing trace with hash -170005224, now seen corresponding path program 1 times [2022-12-13 11:50:14,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:14,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762949634] [2022-12-13 11:50:14,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:14,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:14,926 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:50:14,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:14,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762949634] [2022-12-13 11:50:14,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762949634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:14,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:14,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:50:14,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443484755] [2022-12-13 11:50:14,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:14,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:50:14,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:14,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:50:14,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:50:14,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2022-12-13 11:50:14,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:50:14,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:14,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2022-12-13 11:50:14,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:18,216 INFO L130 PetriNetUnfolder]: 29424/42626 cut-off events. [2022-12-13 11:50:18,216 INFO L131 PetriNetUnfolder]: For 28889/29350 co-relation queries the response was YES. [2022-12-13 11:50:18,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108954 conditions, 42626 events. 29424/42626 cut-off events. For 28889/29350 co-relation queries the response was YES. Maximal size of possible extension queue 1847. Compared 289235 event pairs, 12445 based on Foata normal form. 1360/36088 useless extension candidates. Maximal degree in co-relation 108939. Up to 18373 conditions per place. [2022-12-13 11:50:18,426 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 61 selfloop transitions, 12 changer transitions 4/92 dead transitions. [2022-12-13 11:50:18,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 491 flow [2022-12-13 11:50:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:50:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:50:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-12-13 11:50:18,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6421568627450981 [2022-12-13 11:50:18,428 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 218 flow. Second operand 4 states and 131 transitions. [2022-12-13 11:50:18,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 491 flow [2022-12-13 11:50:18,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:50:18,435 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 266 flow [2022-12-13 11:50:18,436 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2022-12-13 11:50:18,437 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -28 predicate places. [2022-12-13 11:50:18,437 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:18,437 INFO L89 Accepts]: Start accepts. Operand has 63 places, 56 transitions, 266 flow [2022-12-13 11:50:18,438 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:18,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:18,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 56 transitions, 266 flow [2022-12-13 11:50:18,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 56 transitions, 266 flow [2022-12-13 11:50:18,896 INFO L130 PetriNetUnfolder]: 1422/2942 cut-off events. [2022-12-13 11:50:18,897 INFO L131 PetriNetUnfolder]: For 3729/4402 co-relation queries the response was YES. [2022-12-13 11:50:18,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6377 conditions, 2942 events. 1422/2942 cut-off events. For 3729/4402 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 24712 event pairs, 1037 based on Foata normal form. 11/2194 useless extension candidates. Maximal degree in co-relation 6363. Up to 1964 conditions per place. [2022-12-13 11:50:18,927 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 56 transitions, 266 flow [2022-12-13 11:50:18,927 INFO L226 LiptonReduction]: Number of co-enabled transitions 1388 [2022-12-13 11:50:18,938 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:18,948 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 511 [2022-12-13 11:50:18,948 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 266 flow [2022-12-13 11:50:18,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:50:18,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:18,948 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:18,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:50:18,949 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:18,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1400876541, now seen corresponding path program 1 times [2022-12-13 11:50:18,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:18,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74805182] [2022-12-13 11:50:18,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:18,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:19,496 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:50:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:19,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74805182] [2022-12-13 11:50:19,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74805182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:19,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:19,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:50:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662849976] [2022-12-13 11:50:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:19,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:50:19,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:50:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:50:19,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51 [2022-12-13 11:50:19,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 266 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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:50:19,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:19,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51 [2022-12-13 11:50:19,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:22,863 INFO L130 PetriNetUnfolder]: 28807/41751 cut-off events. [2022-12-13 11:50:22,863 INFO L131 PetriNetUnfolder]: For 43804/45530 co-relation queries the response was YES. [2022-12-13 11:50:22,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110219 conditions, 41751 events. 28807/41751 cut-off events. For 43804/45530 co-relation queries the response was YES. Maximal size of possible extension queue 1846. Compared 295017 event pairs, 7046 based on Foata normal form. 317/34752 useless extension candidates. Maximal degree in co-relation 110202. Up to 33897 conditions per place. [2022-12-13 11:50:23,050 INFO L137 encePairwiseOnDemand]: 40/51 looper letters, 67 selfloop transitions, 7 changer transitions 12/102 dead transitions. [2022-12-13 11:50:23,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 102 transitions, 652 flow [2022-12-13 11:50:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:50:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:50:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-12-13 11:50:23,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2022-12-13 11:50:23,052 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 266 flow. Second operand 4 states and 144 transitions. [2022-12-13 11:50:23,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 102 transitions, 652 flow [2022-12-13 11:50:23,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 102 transitions, 629 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:50:23,077 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 284 flow [2022-12-13 11:50:23,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2022-12-13 11:50:23,079 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -25 predicate places. [2022-12-13 11:50:23,079 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:23,079 INFO L89 Accepts]: Start accepts. Operand has 66 places, 58 transitions, 284 flow [2022-12-13 11:50:23,080 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:23,081 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:23,081 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 58 transitions, 284 flow [2022-12-13 11:50:23,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 58 transitions, 284 flow [2022-12-13 11:50:23,297 INFO L130 PetriNetUnfolder]: 1460/2971 cut-off events. [2022-12-13 11:50:23,298 INFO L131 PetriNetUnfolder]: For 3229/4190 co-relation queries the response was YES. [2022-12-13 11:50:23,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7416 conditions, 2971 events. 1460/2971 cut-off events. For 3229/4190 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 24552 event pairs, 1003 based on Foata normal form. 32/2280 useless extension candidates. Maximal degree in co-relation 7400. Up to 1947 conditions per place. [2022-12-13 11:50:23,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 58 transitions, 284 flow [2022-12-13 11:50:23,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 1482 [2022-12-13 11:50:23,337 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:23,338 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-13 11:50:23,338 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 284 flow [2022-12-13 11:50:23,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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:50:23,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:23,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:23,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:50:23,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash 194917954, now seen corresponding path program 1 times [2022-12-13 11:50:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:23,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078462675] [2022-12-13 11:50:23,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:23,554 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:50:23,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:23,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078462675] [2022-12-13 11:50:23,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078462675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:23,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:23,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:50:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180201338] [2022-12-13 11:50:23,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:23,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:50:23,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:23,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:50:23,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:50:23,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2022-12-13 11:50:23,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:50:23,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:23,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2022-12-13 11:50:23,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:26,952 INFO L130 PetriNetUnfolder]: 28897/42100 cut-off events. [2022-12-13 11:50:26,952 INFO L131 PetriNetUnfolder]: For 53713/55255 co-relation queries the response was YES. [2022-12-13 11:50:27,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121524 conditions, 42100 events. 28897/42100 cut-off events. For 53713/55255 co-relation queries the response was YES. Maximal size of possible extension queue 1834. Compared 298832 event pairs, 4168 based on Foata normal form. 260/35107 useless extension candidates. Maximal degree in co-relation 121505. Up to 31774 conditions per place. [2022-12-13 11:50:27,124 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 75 selfloop transitions, 10 changer transitions 5/106 dead transitions. [2022-12-13 11:50:27,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 106 transitions, 696 flow [2022-12-13 11:50:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:50:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:50:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-12-13 11:50:27,126 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.715 [2022-12-13 11:50:27,126 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 284 flow. Second operand 4 states and 143 transitions. [2022-12-13 11:50:27,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 106 transitions, 696 flow [2022-12-13 11:50:27,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 685 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:50:27,149 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 341 flow [2022-12-13 11:50:27,149 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2022-12-13 11:50:27,149 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -23 predicate places. [2022-12-13 11:50:27,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:27,150 INFO L89 Accepts]: Start accepts. Operand has 68 places, 63 transitions, 341 flow [2022-12-13 11:50:27,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:27,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:27,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 63 transitions, 341 flow [2022-12-13 11:50:27,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 63 transitions, 341 flow [2022-12-13 11:50:27,385 INFO L130 PetriNetUnfolder]: 1574/3153 cut-off events. [2022-12-13 11:50:27,386 INFO L131 PetriNetUnfolder]: For 4852/6228 co-relation queries the response was YES. [2022-12-13 11:50:27,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9239 conditions, 3153 events. 1574/3153 cut-off events. For 4852/6228 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 25898 event pairs, 824 based on Foata normal form. 22/2445 useless extension candidates. Maximal degree in co-relation 9222. Up to 2089 conditions per place. [2022-12-13 11:50:27,417 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 63 transitions, 341 flow [2022-12-13 11:50:27,417 INFO L226 LiptonReduction]: Number of co-enabled transitions 1634 [2022-12-13 11:50:27,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [551] $Ultimate##0-->L781: Formula: (and (= v_~x$w_buff0_used~0_364 v_~x$w_buff1_used~0_333) (= v_~x$r_buff1_thd4~0_63 v_~x$r_buff0_thd4~0_69) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_363 256) 0)) (not (= (mod v_~x$w_buff1_used~0_333 256) 0)))) 1 0)) (= v_~x$r_buff1_thd1~0_63 v_~x$r_buff0_thd1~0_67) (= v_~x$r_buff0_thd2~0_90 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_15|) (= v_~x$w_buff0_used~0_363 1) (= v_~x$w_buff0~0_245 v_~x$w_buff1~0_228) (= v_~x$r_buff1_thd2~0_57 v_~x$r_buff0_thd2~0_91) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= 2 v_~x$w_buff0~0_244) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$r_buff0_thd0~0_236 v_~x$r_buff1_thd0~0_236) (= v_~x$r_buff1_thd3~0_61 v_~x$r_buff0_thd3~0_69)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_245, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_236, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_69, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_91, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_364, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_244, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_236, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_228, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_333, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_63, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_69, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_90, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_236, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_363, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_15|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-13 11:50:27,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [401] L827-->L834: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_147 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= 0 (mod v_~x$w_buff0_used~0_148 256))) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_133 256) 0)) .cse3)) (.cse0 (and .cse2 .cse5))) (and (= v_~x$r_buff0_thd4~0_23 (ite .cse0 0 v_~x$r_buff0_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_148) v_~x$w_buff0_used~0_147) (= v_~x$r_buff1_thd4~0_21 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_22)) (= v_~x~0_99 (ite .cse1 v_~x$w_buff0~0_64 (ite .cse4 v_~x$w_buff1~0_63 v_~x~0_100))) (= v_~x$w_buff1_used~0_132 (ite (or .cse4 .cse0) 0 v_~x$w_buff1_used~0_133))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_100, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_148} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_99, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_147} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-13 11:50:27,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [393] L804-->L811: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_97 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_98 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_89 256) 0)) .cse0)) (.cse4 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_88 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd3~0_19 256) 0)))) 0 v_~x$r_buff1_thd3~0_16) v_~x$r_buff1_thd3~0_15) (= (ite .cse2 0 v_~x$w_buff0_used~0_98) v_~x$w_buff0_used~0_97) (= v_~x~0_61 (ite .cse2 v_~x$w_buff0~0_32 (ite .cse3 v_~x$w_buff1~0_33 v_~x~0_62))) (= v_~x$w_buff1_used~0_88 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_89)) (= v_~x$r_buff0_thd3~0_19 (ite .cse4 0 v_~x$r_buff0_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ~x~0=v_~x~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:50:27,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [270] L863-->L869: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_60 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_143 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_66 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256))))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_144 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_66) v_~x$r_buff0_thd0~0_65) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x~0_95 (ite .cse2 v_~x$w_buff0~0_62 (ite .cse1 v_~x$w_buff1~0_61 v_~x~0_96))) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd0~0_65 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_60) v_~x$r_buff1_thd0~0_59) (= (ite .cse2 0 v_~x$w_buff0_used~0_144) v_~x$w_buff0_used~0_143)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_62, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_60, ~x~0=v_~x~0_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_144} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_62, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_65, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_59, ~x~0=v_~x~0_95, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_143} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:50:27,968 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:50:27,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 818 [2022-12-13 11:50:27,969 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 355 flow [2022-12-13 11:50:27,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:50:27,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:27,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:27,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:50:27,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash -405888235, now seen corresponding path program 1 times [2022-12-13 11:50:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:27,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139004425] [2022-12-13 11:50:27,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:28,381 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:50:28,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:28,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139004425] [2022-12-13 11:50:28,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139004425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:28,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:28,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:50:28,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457222356] [2022-12-13 11:50:28,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:28,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:50:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:28,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:50:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:50:28,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2022-12-13 11:50:28,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:50:28,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:28,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2022-12-13 11:50:28,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:31,679 INFO L130 PetriNetUnfolder]: 28040/40731 cut-off events. [2022-12-13 11:50:31,679 INFO L131 PetriNetUnfolder]: For 83217/84753 co-relation queries the response was YES. [2022-12-13 11:50:31,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128590 conditions, 40731 events. 28040/40731 cut-off events. For 83217/84753 co-relation queries the response was YES. Maximal size of possible extension queue 1841. Compared 286424 event pairs, 4453 based on Foata normal form. 299/33931 useless extension candidates. Maximal degree in co-relation 128570. Up to 31714 conditions per place. [2022-12-13 11:50:31,894 INFO L137 encePairwiseOnDemand]: 50/55 looper letters, 60 selfloop transitions, 4 changer transitions 5/85 dead transitions. [2022-12-13 11:50:31,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 607 flow [2022-12-13 11:50:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:50:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:50:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2022-12-13 11:50:31,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2022-12-13 11:50:31,895 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 355 flow. Second operand 3 states and 108 transitions. [2022-12-13 11:50:31,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 607 flow [2022-12-13 11:50:32,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 554 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-13 11:50:32,040 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 317 flow [2022-12-13 11:50:32,040 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2022-12-13 11:50:32,040 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -23 predicate places. [2022-12-13 11:50:32,041 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:32,041 INFO L89 Accepts]: Start accepts. Operand has 68 places, 61 transitions, 317 flow [2022-12-13 11:50:32,041 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:32,041 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:32,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 61 transitions, 317 flow [2022-12-13 11:50:32,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 61 transitions, 317 flow [2022-12-13 11:50:32,249 INFO L130 PetriNetUnfolder]: 1477/3023 cut-off events. [2022-12-13 11:50:32,249 INFO L131 PetriNetUnfolder]: For 4265/5355 co-relation queries the response was YES. [2022-12-13 11:50:32,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7683 conditions, 3023 events. 1477/3023 cut-off events. For 4265/5355 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 25207 event pairs, 811 based on Foata normal form. 10/2280 useless extension candidates. Maximal degree in co-relation 7665. Up to 1961 conditions per place. [2022-12-13 11:50:32,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 61 transitions, 317 flow [2022-12-13 11:50:32,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 1562 [2022-12-13 11:50:32,286 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:32,286 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-13 11:50:32,286 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 317 flow [2022-12-13 11:50:32,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:50:32,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:32,287 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:32,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:50:32,287 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:32,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash 195106310, now seen corresponding path program 1 times [2022-12-13 11:50:32,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:32,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317854753] [2022-12-13 11:50:32,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:32,659 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:50:32,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:32,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317854753] [2022-12-13 11:50:32,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317854753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:32,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:32,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:50:32,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209778300] [2022-12-13 11:50:32,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:32,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:50:32,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:32,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:50:32,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:50:32,662 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2022-12-13 11:50:32,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:50:32,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:32,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2022-12-13 11:50:32,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:36,013 INFO L130 PetriNetUnfolder]: 29353/42491 cut-off events. [2022-12-13 11:50:36,013 INFO L131 PetriNetUnfolder]: For 69162/70566 co-relation queries the response was YES. [2022-12-13 11:50:36,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125101 conditions, 42491 events. 29353/42491 cut-off events. For 69162/70566 co-relation queries the response was YES. Maximal size of possible extension queue 1924. Compared 296861 event pairs, 4954 based on Foata normal form. 252/35406 useless extension candidates. Maximal degree in co-relation 125080. Up to 32821 conditions per place. [2022-12-13 11:50:36,238 INFO L137 encePairwiseOnDemand]: 41/54 looper letters, 72 selfloop transitions, 9 changer transitions 10/107 dead transitions. [2022-12-13 11:50:36,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 107 transitions, 721 flow [2022-12-13 11:50:36,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:50:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:50:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-12-13 11:50:36,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:50:36,239 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 317 flow. Second operand 4 states and 144 transitions. [2022-12-13 11:50:36,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 107 transitions, 721 flow [2022-12-13 11:50:36,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 107 transitions, 709 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:50:36,259 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 375 flow [2022-12-13 11:50:36,259 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=375, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2022-12-13 11:50:36,260 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -22 predicate places. [2022-12-13 11:50:36,260 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:36,260 INFO L89 Accepts]: Start accepts. Operand has 69 places, 66 transitions, 375 flow [2022-12-13 11:50:36,261 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:36,261 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:36,262 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 66 transitions, 375 flow [2022-12-13 11:50:36,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 66 transitions, 375 flow [2022-12-13 11:50:36,501 INFO L130 PetriNetUnfolder]: 1704/3333 cut-off events. [2022-12-13 11:50:36,501 INFO L131 PetriNetUnfolder]: For 5181/6807 co-relation queries the response was YES. [2022-12-13 11:50:36,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10137 conditions, 3333 events. 1704/3333 cut-off events. For 5181/6807 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 27025 event pairs, 760 based on Foata normal form. 10/2555 useless extension candidates. Maximal degree in co-relation 10119. Up to 2256 conditions per place. [2022-12-13 11:50:36,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 66 transitions, 375 flow [2022-12-13 11:50:36,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 1716 [2022-12-13 11:50:36,536 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:36,537 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 277 [2022-12-13 11:50:36,537 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 375 flow [2022-12-13 11:50:36,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:50:36,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:36,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:36,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:50:36,538 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:36,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:36,538 INFO L85 PathProgramCache]: Analyzing trace with hash 203841800, now seen corresponding path program 2 times [2022-12-13 11:50:36,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:36,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180305156] [2022-12-13 11:50:36,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:36,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:36,988 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:50:36,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:36,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180305156] [2022-12-13 11:50:36,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180305156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:36,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:36,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:50:36,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848512435] [2022-12-13 11:50:36,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:36,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:50:36,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:36,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:50:36,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:50:36,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2022-12-13 11:50:36,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 375 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:50:36,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:36,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2022-12-13 11:50:36,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:40,348 INFO L130 PetriNetUnfolder]: 29668/42954 cut-off events. [2022-12-13 11:50:40,348 INFO L131 PetriNetUnfolder]: For 91076/92539 co-relation queries the response was YES. [2022-12-13 11:50:40,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140357 conditions, 42954 events. 29668/42954 cut-off events. For 91076/92539 co-relation queries the response was YES. Maximal size of possible extension queue 1952. Compared 300703 event pairs, 5051 based on Foata normal form. 268/35814 useless extension candidates. Maximal degree in co-relation 140336. Up to 32909 conditions per place. [2022-12-13 11:50:40,536 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 73 selfloop transitions, 12 changer transitions 10/111 dead transitions. [2022-12-13 11:50:40,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 111 transitions, 813 flow [2022-12-13 11:50:40,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:50:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:50:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-12-13 11:50:40,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:50:40,538 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 375 flow. Second operand 4 states and 144 transitions. [2022-12-13 11:50:40,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 111 transitions, 813 flow [2022-12-13 11:50:40,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 795 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 11:50:40,562 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 438 flow [2022-12-13 11:50:40,562 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=438, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2022-12-13 11:50:40,563 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -20 predicate places. [2022-12-13 11:50:40,563 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:40,563 INFO L89 Accepts]: Start accepts. Operand has 71 places, 70 transitions, 438 flow [2022-12-13 11:50:40,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:40,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:40,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 70 transitions, 438 flow [2022-12-13 11:50:40,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 70 transitions, 438 flow [2022-12-13 11:50:40,810 INFO L130 PetriNetUnfolder]: 1790/3477 cut-off events. [2022-12-13 11:50:40,810 INFO L131 PetriNetUnfolder]: For 7524/9183 co-relation queries the response was YES. [2022-12-13 11:50:40,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11815 conditions, 3477 events. 1790/3477 cut-off events. For 7524/9183 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 28303 event pairs, 764 based on Foata normal form. 12/2681 useless extension candidates. Maximal degree in co-relation 11796. Up to 2379 conditions per place. [2022-12-13 11:50:40,833 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 70 transitions, 438 flow [2022-12-13 11:50:40,833 INFO L226 LiptonReduction]: Number of co-enabled transitions 1796 [2022-12-13 11:50:40,840 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:40,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 278 [2022-12-13 11:50:40,841 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 438 flow [2022-12-13 11:50:40,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:50:40,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:40,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:40,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:50:40,841 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:40,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash 198956944, now seen corresponding path program 1 times [2022-12-13 11:50:40,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:40,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569366399] [2022-12-13 11:50:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:41,325 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:50:41,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:41,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569366399] [2022-12-13 11:50:41,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569366399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:41,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:41,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:50:41,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557332976] [2022-12-13 11:50:41,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:41,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:50:41,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:41,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:50:41,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:50:41,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2022-12-13 11:50:41,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 438 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:50:41,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:41,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2022-12-13 11:50:41,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:45,594 INFO L130 PetriNetUnfolder]: 35225/51164 cut-off events. [2022-12-13 11:50:45,594 INFO L131 PetriNetUnfolder]: For 144558/146289 co-relation queries the response was YES. [2022-12-13 11:50:45,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177287 conditions, 51164 events. 35225/51164 cut-off events. For 144558/146289 co-relation queries the response was YES. Maximal size of possible extension queue 2406. Compared 368436 event pairs, 5217 based on Foata normal form. 449/42945 useless extension candidates. Maximal degree in co-relation 177265. Up to 35659 conditions per place. [2022-12-13 11:50:45,858 INFO L137 encePairwiseOnDemand]: 41/54 looper letters, 80 selfloop transitions, 17 changer transitions 10/123 dead transitions. [2022-12-13 11:50:45,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 123 transitions, 962 flow [2022-12-13 11:50:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:50:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:50:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-12-13 11:50:45,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2022-12-13 11:50:45,859 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 438 flow. Second operand 4 states and 148 transitions. [2022-12-13 11:50:45,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 123 transitions, 962 flow [2022-12-13 11:50:45,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 123 transitions, 941 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 11:50:45,892 INFO L231 Difference]: Finished difference. Result has 73 places, 78 transitions, 555 flow [2022-12-13 11:50:45,892 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=73, PETRI_TRANSITIONS=78} [2022-12-13 11:50:45,893 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -18 predicate places. [2022-12-13 11:50:45,893 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:45,893 INFO L89 Accepts]: Start accepts. Operand has 73 places, 78 transitions, 555 flow [2022-12-13 11:50:45,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:45,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:45,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 78 transitions, 555 flow [2022-12-13 11:50:45,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 555 flow [2022-12-13 11:50:46,312 INFO L130 PetriNetUnfolder]: 2079/3897 cut-off events. [2022-12-13 11:50:46,313 INFO L131 PetriNetUnfolder]: For 11198/14584 co-relation queries the response was YES. [2022-12-13 11:50:46,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15544 conditions, 3897 events. 2079/3897 cut-off events. For 11198/14584 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 31164 event pairs, 736 based on Foata normal form. 13/3102 useless extension candidates. Maximal degree in co-relation 15524. Up to 2820 conditions per place. [2022-12-13 11:50:46,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 78 transitions, 555 flow [2022-12-13 11:50:46,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 2042 [2022-12-13 11:50:46,355 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:46,356 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 463 [2022-12-13 11:50:46,356 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 555 flow [2022-12-13 11:50:46,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:50:46,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:46,356 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:50:46,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:50:46,356 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:46,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:46,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1352221225, now seen corresponding path program 1 times [2022-12-13 11:50:46,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:46,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562839895] [2022-12-13 11:50:46,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:46,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:46,912 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:50:46,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:46,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562839895] [2022-12-13 11:50:46,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562839895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:46,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:46,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:50:46,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930963352] [2022-12-13 11:50:46,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:46,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:50:46,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:46,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:50:46,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:50:46,914 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2022-12-13 11:50:46,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:50:46,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:46,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2022-12-13 11:50:46,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:52,244 INFO L130 PetriNetUnfolder]: 39875/58264 cut-off events. [2022-12-13 11:50:52,245 INFO L131 PetriNetUnfolder]: For 212718/214688 co-relation queries the response was YES. [2022-12-13 11:50:52,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224644 conditions, 58264 events. 39875/58264 cut-off events. For 212718/214688 co-relation queries the response was YES. Maximal size of possible extension queue 2856. Compared 434311 event pairs, 5015 based on Foata normal form. 452/48787 useless extension candidates. Maximal degree in co-relation 224621. Up to 40522 conditions per place. [2022-12-13 11:50:52,561 INFO L137 encePairwiseOnDemand]: 41/54 looper letters, 99 selfloop transitions, 23 changer transitions 12/150 dead transitions. [2022-12-13 11:50:52,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 150 transitions, 1283 flow [2022-12-13 11:50:52,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:50:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:50:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-12-13 11:50:52,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2022-12-13 11:50:52,563 INFO L175 Difference]: Start difference. First operand has 73 places, 78 transitions, 555 flow. Second operand 5 states and 182 transitions. [2022-12-13 11:50:52,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 150 transitions, 1283 flow [2022-12-13 11:50:52,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 150 transitions, 1260 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:50:52,598 INFO L231 Difference]: Finished difference. Result has 77 places, 88 transitions, 747 flow [2022-12-13 11:50:52,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=747, PETRI_PLACES=77, PETRI_TRANSITIONS=88} [2022-12-13 11:50:52,599 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -14 predicate places. [2022-12-13 11:50:52,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:52,599 INFO L89 Accepts]: Start accepts. Operand has 77 places, 88 transitions, 747 flow [2022-12-13 11:50:52,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:52,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:52,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 88 transitions, 747 flow [2022-12-13 11:50:52,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 88 transitions, 747 flow [2022-12-13 11:50:53,050 INFO L130 PetriNetUnfolder]: 2249/4279 cut-off events. [2022-12-13 11:50:53,051 INFO L131 PetriNetUnfolder]: For 17146/21075 co-relation queries the response was YES. [2022-12-13 11:50:53,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19001 conditions, 4279 events. 2249/4279 cut-off events. For 17146/21075 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 35138 event pairs, 779 based on Foata normal form. 15/3419 useless extension candidates. Maximal degree in co-relation 18979. Up to 3126 conditions per place. [2022-12-13 11:50:53,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 88 transitions, 747 flow [2022-12-13 11:50:53,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 2346 [2022-12-13 11:50:53,097 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:53,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 499 [2022-12-13 11:50:53,098 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 88 transitions, 747 flow [2022-12-13 11:50:53,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:50:53,098 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:53,098 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:50:53,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:50:53,099 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:53,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:53,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2006873549, now seen corresponding path program 1 times [2022-12-13 11:50:53,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:53,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35388624] [2022-12-13 11:50:53,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:53,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:53,697 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:50:53,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:53,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35388624] [2022-12-13 11:50:53,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35388624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:53,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:53,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:50:53,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990635029] [2022-12-13 11:50:53,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:53,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:50:53,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:53,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:50:53,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:50:53,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2022-12-13 11:50:53,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 88 transitions, 747 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:50:53,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:53,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2022-12-13 11:50:53,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:59,330 INFO L130 PetriNetUnfolder]: 42522/61755 cut-off events. [2022-12-13 11:50:59,330 INFO L131 PetriNetUnfolder]: For 321932/324090 co-relation queries the response was YES. [2022-12-13 11:50:59,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261622 conditions, 61755 events. 42522/61755 cut-off events. For 321932/324090 co-relation queries the response was YES. Maximal size of possible extension queue 3068. Compared 457542 event pairs, 6634 based on Foata normal form. 508/51376 useless extension candidates. Maximal degree in co-relation 261597. Up to 36738 conditions per place. [2022-12-13 11:50:59,652 INFO L137 encePairwiseOnDemand]: 41/54 looper letters, 91 selfloop transitions, 45 changer transitions 11/163 dead transitions. [2022-12-13 11:50:59,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 163 transitions, 1639 flow [2022-12-13 11:50:59,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:50:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:50:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2022-12-13 11:50:59,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2022-12-13 11:50:59,656 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 747 flow. Second operand 5 states and 185 transitions. [2022-12-13 11:50:59,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 163 transitions, 1639 flow [2022-12-13 11:50:59,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 163 transitions, 1588 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-13 11:50:59,827 INFO L231 Difference]: Finished difference. Result has 82 places, 103 transitions, 1081 flow [2022-12-13 11:50:59,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1081, PETRI_PLACES=82, PETRI_TRANSITIONS=103} [2022-12-13 11:50:59,828 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -9 predicate places. [2022-12-13 11:50:59,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:59,828 INFO L89 Accepts]: Start accepts. Operand has 82 places, 103 transitions, 1081 flow [2022-12-13 11:50:59,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:59,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:59,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 103 transitions, 1081 flow [2022-12-13 11:50:59,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 103 transitions, 1081 flow [2022-12-13 11:51:00,343 INFO L130 PetriNetUnfolder]: 2434/4445 cut-off events. [2022-12-13 11:51:00,343 INFO L131 PetriNetUnfolder]: For 28742/31933 co-relation queries the response was YES. [2022-12-13 11:51:00,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23629 conditions, 4445 events. 2434/4445 cut-off events. For 28742/31933 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 35236 event pairs, 843 based on Foata normal form. 235/3821 useless extension candidates. Maximal degree in co-relation 23604. Up to 3397 conditions per place. [2022-12-13 11:51:00,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 103 transitions, 1081 flow [2022-12-13 11:51:00,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 2642 [2022-12-13 11:51:00,399 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:51:00,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 571 [2022-12-13 11:51:00,400 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 103 transitions, 1081 flow [2022-12-13 11:51:00,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:51:00,400 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:51:00,400 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:51:00,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:51:00,400 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:51:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1753306972, now seen corresponding path program 1 times [2022-12-13 11:51:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:00,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367777547] [2022-12-13 11:51:00,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:00,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:00,903 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:51:00,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:51:00,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367777547] [2022-12-13 11:51:00,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367777547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:51:00,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:51:00,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:51:00,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026560897] [2022-12-13 11:51:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:51:00,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:51:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:51:00,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:51:00,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:51:00,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2022-12-13 11:51:00,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 103 transitions, 1081 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:51:00,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:51:00,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2022-12-13 11:51:00,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:51:06,963 INFO L130 PetriNetUnfolder]: 44550/65019 cut-off events. [2022-12-13 11:51:06,964 INFO L131 PetriNetUnfolder]: For 474480/476779 co-relation queries the response was YES. [2022-12-13 11:51:07,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295865 conditions, 65019 events. 44550/65019 cut-off events. For 474480/476779 co-relation queries the response was YES. Maximal size of possible extension queue 3293. Compared 492365 event pairs, 6924 based on Foata normal form. 843/54190 useless extension candidates. Maximal degree in co-relation 295837. Up to 34935 conditions per place. [2022-12-13 11:51:07,521 INFO L137 encePairwiseOnDemand]: 44/54 looper letters, 84 selfloop transitions, 38 changer transitions 12/150 dead transitions. [2022-12-13 11:51:07,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 150 transitions, 1725 flow [2022-12-13 11:51:07,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:51:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:51:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-12-13 11:51:07,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2022-12-13 11:51:07,522 INFO L175 Difference]: Start difference. First operand has 82 places, 103 transitions, 1081 flow. Second operand 4 states and 148 transitions. [2022-12-13 11:51:07,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 150 transitions, 1725 flow [2022-12-13 11:51:08,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 150 transitions, 1664 flow, removed 28 selfloop flow, removed 1 redundant places. [2022-12-13 11:51:08,338 INFO L231 Difference]: Finished difference. Result has 85 places, 103 transitions, 1146 flow [2022-12-13 11:51:08,338 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1146, PETRI_PLACES=85, PETRI_TRANSITIONS=103} [2022-12-13 11:51:08,339 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2022-12-13 11:51:08,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:51:08,339 INFO L89 Accepts]: Start accepts. Operand has 85 places, 103 transitions, 1146 flow [2022-12-13 11:51:08,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:51:08,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:51:08,340 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 103 transitions, 1146 flow [2022-12-13 11:51:08,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 103 transitions, 1146 flow [2022-12-13 11:51:08,707 INFO L130 PetriNetUnfolder]: 2381/4538 cut-off events. [2022-12-13 11:51:08,708 INFO L131 PetriNetUnfolder]: For 30391/33618 co-relation queries the response was YES. [2022-12-13 11:51:08,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24866 conditions, 4538 events. 2381/4538 cut-off events. For 30391/33618 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 37894 event pairs, 862 based on Foata normal form. 185/3781 useless extension candidates. Maximal degree in co-relation 24839. Up to 3352 conditions per place. [2022-12-13 11:51:08,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 103 transitions, 1146 flow [2022-12-13 11:51:08,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 2702 [2022-12-13 11:51:08,769 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:51:08,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 432 [2022-12-13 11:51:08,771 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 103 transitions, 1146 flow [2022-12-13 11:51:08,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:51:08,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:51:08,771 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:51:08,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:51:08,772 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:51:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:08,772 INFO L85 PathProgramCache]: Analyzing trace with hash -100424728, now seen corresponding path program 1 times [2022-12-13 11:51:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:08,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662785007] [2022-12-13 11:51:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:08,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:09,122 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:51:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:51:09,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662785007] [2022-12-13 11:51:09,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662785007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:51:09,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:51:09,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:51:09,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540408038] [2022-12-13 11:51:09,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:51:09,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:51:09,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:51:09,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:51:09,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:51:09,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2022-12-13 11:51:09,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 103 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:51:09,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:51:09,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2022-12-13 11:51:09,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand