/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:30:32,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:30:32,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:30:32,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:30:32,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:30:32,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:30:32,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:30:32,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:30:32,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:30:32,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:30:32,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:30:32,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:30:32,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:30:32,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:30:32,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:30:32,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:30:32,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:30:32,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:30:32,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:30:32,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:30:32,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:30:32,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:30:32,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:30:32,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:30:32,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:30:32,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:30:32,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:30:32,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:30:32,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:30:32,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:30:32,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:30:32,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:30:32,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:30:32,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:30:32,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:30:32,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:30:32,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:30:32,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:30:32,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:30:32,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:30:32,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:30:32,535 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-SemanticLbe.epf [2022-12-12 14:30:32,567 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:30:32,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:30:32,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:30:32,569 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:30:32,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:30:32,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:30:32,571 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:30:32,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:30:32,571 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:30:32,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:30:32,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:30:32,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:30:32,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:30:32,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:30:32,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:30:32,573 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:30:32,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:30:32,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:30:32,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:30:32,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:30:32,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:30:32,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:30:32,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:30:32,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:30:32,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:30:32,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:30:32,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:30:32,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:30:32,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:30:32,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:30:32,575 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-12 14:30:32,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:30:32,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:30:32,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:30:32,918 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:30:32,919 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:30:32,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2022-12-12 14:30:34,130 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:30:34,414 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:30:34,415 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2022-12-12 14:30:34,433 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc40317a/bf512a3f1e6c4d40bc357eaca608997d/FLAG43e575cfd [2022-12-12 14:30:34,446 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc40317a/bf512a3f1e6c4d40bc357eaca608997d [2022-12-12 14:30:34,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:30:34,449 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:30:34,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:30:34,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:30:34,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:30:34,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:30:34" (1/1) ... [2022-12-12 14:30:34,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f2532e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:34, skipping insertion in model container [2022-12-12 14:30:34,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:30:34" (1/1) ... [2022-12-12 14:30:34,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:30:34,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:30:34,673 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/mix019_tso.oepc.i[949,962] [2022-12-12 14:30:34,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:30:34,919 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:30:34,934 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/mix019_tso.oepc.i[949,962] [2022-12-12 14:30:34,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:34,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:34,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:35,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:35,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:35,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:35,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:30:35,034 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:30:35,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35 WrapperNode [2022-12-12 14:30:35,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:30:35,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:30:35,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:30:35,036 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:30:35,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (1/1) ... [2022-12-12 14:30:35,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (1/1) ... [2022-12-12 14:30:35,088 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-12 14:30:35,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:30:35,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:30:35,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:30:35,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:30:35,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (1/1) ... [2022-12-12 14:30:35,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (1/1) ... [2022-12-12 14:30:35,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (1/1) ... [2022-12-12 14:30:35,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (1/1) ... [2022-12-12 14:30:35,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (1/1) ... [2022-12-12 14:30:35,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (1/1) ... [2022-12-12 14:30:35,123 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (1/1) ... [2022-12-12 14:30:35,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (1/1) ... [2022-12-12 14:30:35,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:30:35,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:30:35,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:30:35,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:30:35,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (1/1) ... [2022-12-12 14:30:35,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:30:35,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:30:35,172 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-12 14:30:35,189 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-12 14:30:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:30:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:30:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:30:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:30:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:30:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:30:35,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:30:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:30:35,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:30:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:30:35,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:30:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:30:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:30:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:30:35,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:30:35,208 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:30:35,350 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:30:35,352 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:30:35,694 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:30:35,843 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:30:35,843 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:30:35,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:30:35 BoogieIcfgContainer [2022-12-12 14:30:35,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:30:35,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:30:35,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:30:35,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:30:35,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:30:34" (1/3) ... [2022-12-12 14:30:35,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26000543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:30:35, skipping insertion in model container [2022-12-12 14:30:35,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:35" (2/3) ... [2022-12-12 14:30:35,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26000543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:30:35, skipping insertion in model container [2022-12-12 14:30:35,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:30:35" (3/3) ... [2022-12-12 14:30:35,855 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2022-12-12 14:30:35,872 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:30:35,872 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:30:35,872 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:30:35,931 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:30:35,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-12 14:30:36,041 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-12 14:30:36,041 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:30:36,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-12 14:30:36,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-12 14:30:36,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-12 14:30:36,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:30:36,073 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-12 14:30:36,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-12 14:30:36,102 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-12 14:30:36,102 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:30:36,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-12 14:30:36,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-12 14:30:36,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 1994 [2022-12-12 14:30:44,529 INFO L241 LiptonReduction]: Total number of compositions: 86 [2022-12-12 14:30:44,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:30:44,547 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=PETRI_NET, 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;@3d7e4e99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:30:44,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 14:30:44,551 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-12 14:30:44,551 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:30:44,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:44,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 14:30:44,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:44,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:44,556 INFO L85 PathProgramCache]: Analyzing trace with hash 483742250, now seen corresponding path program 1 times [2022-12-12 14:30:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:44,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234090525] [2022-12-12 14:30:44,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:44,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:44,969 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-12 14:30:44,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:44,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234090525] [2022-12-12 14:30:44,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234090525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:44,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:44,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:30:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664361738] [2022-12-12 14:30:44,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:44,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:30:44,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:44,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:30:44,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:30:44,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 62 [2022-12-12 14:30:44,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:30:44,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:44,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 62 [2022-12-12 14:30:44,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:46,645 INFO L130 PetriNetUnfolder]: 7924/12849 cut-off events. [2022-12-12 14:30:46,645 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-12 14:30:46,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24251 conditions, 12849 events. 7924/12849 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 98494 event pairs, 1048 based on Foata normal form. 0/7896 useless extension candidates. Maximal degree in co-relation 24240. Up to 9597 conditions per place. [2022-12-12 14:30:46,694 INFO L137 encePairwiseOnDemand]: 57/62 looper letters, 32 selfloop transitions, 2 changer transitions 52/98 dead transitions. [2022-12-12 14:30:46,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 380 flow [2022-12-12 14:30:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:30:46,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:30:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-12-12 14:30:46,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6827956989247311 [2022-12-12 14:30:46,707 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 3 states and 127 transitions. [2022-12-12 14:30:46,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 98 transitions, 380 flow [2022-12-12 14:30:46,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 98 transitions, 376 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:30:46,712 INFO L231 Difference]: Finished difference. Result has 68 places, 33 transitions, 76 flow [2022-12-12 14:30:46,714 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=68, PETRI_TRANSITIONS=33} [2022-12-12 14:30:46,720 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -3 predicate places. [2022-12-12 14:30:46,720 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 33 transitions, 76 flow [2022-12-12 14:30:46,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:30:46,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:46,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:46,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:30:46,721 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:46,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash 868175786, now seen corresponding path program 1 times [2022-12-12 14:30:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:46,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607244857] [2022-12-12 14:30:46,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:46,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:47,268 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-12 14:30:47,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:47,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607244857] [2022-12-12 14:30:47,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607244857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:47,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:47,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:30:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056931967] [2022-12-12 14:30:47,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:47,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:30:47,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:47,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:30:47,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:30:47,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 62 [2022-12-12 14:30:47,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:30:47,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:47,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 62 [2022-12-12 14:30:47,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:47,725 INFO L130 PetriNetUnfolder]: 2231/3424 cut-off events. [2022-12-12 14:30:47,725 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-12-12 14:30:47,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 3424 events. 2231/3424 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16411 event pairs, 671 based on Foata normal form. 72/3014 useless extension candidates. Maximal degree in co-relation 6924. Up to 2425 conditions per place. [2022-12-12 14:30:47,746 INFO L137 encePairwiseOnDemand]: 59/62 looper letters, 35 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-12 14:30:47,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 176 flow [2022-12-12 14:30:47,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:30:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:30:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-12 14:30:47,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 14:30:47,749 INFO L175 Difference]: Start difference. First operand has 68 places, 33 transitions, 76 flow. Second operand 3 states and 62 transitions. [2022-12-12 14:30:47,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 176 flow [2022-12-12 14:30:47,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:30:47,752 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 80 flow [2022-12-12 14:30:47,752 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-12 14:30:47,753 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -28 predicate places. [2022-12-12 14:30:47,753 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 80 flow [2022-12-12 14:30:47,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:30:47,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:47,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:47,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:30:47,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1092892039, now seen corresponding path program 1 times [2022-12-12 14:30:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:47,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082949440] [2022-12-12 14:30:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:47,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:48,161 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-12 14:30:48,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:48,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082949440] [2022-12-12 14:30:48,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082949440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:48,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:48,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:30:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426745947] [2022-12-12 14:30:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:48,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:30:48,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:48,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:30:48,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:30:48,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 14:30:48,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-12 14:30:48,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:48,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 14:30:48,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:48,420 INFO L130 PetriNetUnfolder]: 1318/2098 cut-off events. [2022-12-12 14:30:48,420 INFO L131 PetriNetUnfolder]: For 70/75 co-relation queries the response was YES. [2022-12-12 14:30:48,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4250 conditions, 2098 events. 1318/2098 cut-off events. For 70/75 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10617 event pairs, 804 based on Foata normal form. 12/1750 useless extension candidates. Maximal degree in co-relation 4239. Up to 1881 conditions per place. [2022-12-12 14:30:48,432 INFO L137 encePairwiseOnDemand]: 56/62 looper letters, 35 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-12-12 14:30:48,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 208 flow [2022-12-12 14:30:48,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:30:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:30:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-12 14:30:48,438 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2022-12-12 14:30:48,438 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 80 flow. Second operand 4 states and 87 transitions. [2022-12-12 14:30:48,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 208 flow [2022-12-12 14:30:48,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:30:48,441 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 121 flow [2022-12-12 14:30:48,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-12 14:30:48,443 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2022-12-12 14:30:48,443 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 121 flow [2022-12-12 14:30:48,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-12 14:30:48,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:48,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:48,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:30:48,450 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:48,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash -481497583, now seen corresponding path program 1 times [2022-12-12 14:30:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:48,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945214188] [2022-12-12 14:30:48,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:48,919 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-12 14:30:48,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:48,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945214188] [2022-12-12 14:30:48,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945214188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:48,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:48,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:30:48,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513668725] [2022-12-12 14:30:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:48,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:30:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:30:48,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:30:48,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 14:30:48,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-12 14:30:48,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:48,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 14:30:48,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:49,218 INFO L130 PetriNetUnfolder]: 1326/2116 cut-off events. [2022-12-12 14:30:49,218 INFO L131 PetriNetUnfolder]: For 696/789 co-relation queries the response was YES. [2022-12-12 14:30:49,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4944 conditions, 2116 events. 1326/2116 cut-off events. For 696/789 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10763 event pairs, 766 based on Foata normal form. 22/1779 useless extension candidates. Maximal degree in co-relation 4931. Up to 1894 conditions per place. [2022-12-12 14:30:49,230 INFO L137 encePairwiseOnDemand]: 55/62 looper letters, 37 selfloop transitions, 14 changer transitions 0/62 dead transitions. [2022-12-12 14:30:49,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 291 flow [2022-12-12 14:30:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:30:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:30:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-12 14:30:49,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2022-12-12 14:30:49,231 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 121 flow. Second operand 5 states and 104 transitions. [2022-12-12 14:30:49,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 291 flow [2022-12-12 14:30:49,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 291 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-12 14:30:49,234 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 209 flow [2022-12-12 14:30:49,234 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-12 14:30:49,235 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -19 predicate places. [2022-12-12 14:30:49,235 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 209 flow [2022-12-12 14:30:49,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-12 14:30:49,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:49,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:49,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:30:49,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:49,237 INFO L85 PathProgramCache]: Analyzing trace with hash -480009583, now seen corresponding path program 2 times [2022-12-12 14:30:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:49,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142397519] [2022-12-12 14:30:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:49,968 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-12 14:30:49,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:49,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142397519] [2022-12-12 14:30:49,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142397519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:49,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:49,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:30:49,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293676080] [2022-12-12 14:30:49,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:49,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:30:49,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:49,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:30:49,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:30:49,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 62 [2022-12-12 14:30:49,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-12 14:30:49,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:49,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 62 [2022-12-12 14:30:49,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:50,555 INFO L130 PetriNetUnfolder]: 2450/3757 cut-off events. [2022-12-12 14:30:50,555 INFO L131 PetriNetUnfolder]: For 2778/2778 co-relation queries the response was YES. [2022-12-12 14:30:50,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9888 conditions, 3757 events. 2450/3757 cut-off events. For 2778/2778 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 18892 event pairs, 965 based on Foata normal form. 35/3291 useless extension candidates. Maximal degree in co-relation 9871. Up to 3045 conditions per place. [2022-12-12 14:30:50,580 INFO L137 encePairwiseOnDemand]: 51/62 looper letters, 59 selfloop transitions, 24 changer transitions 0/91 dead transitions. [2022-12-12 14:30:50,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 91 transitions, 509 flow [2022-12-12 14:30:50,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:30:50,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:30:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-12 14:30:50,582 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36129032258064514 [2022-12-12 14:30:50,582 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 209 flow. Second operand 5 states and 112 transitions. [2022-12-12 14:30:50,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 91 transitions, 509 flow [2022-12-12 14:30:50,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 494 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-12 14:30:50,594 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 344 flow [2022-12-12 14:30:50,594 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2022-12-12 14:30:50,595 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -14 predicate places. [2022-12-12 14:30:50,595 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 344 flow [2022-12-12 14:30:50,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-12 14:30:50,596 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:50,596 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:50,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:30:50,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:50,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:50,597 INFO L85 PathProgramCache]: Analyzing trace with hash 876851510, now seen corresponding path program 1 times [2022-12-12 14:30:50,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:50,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041610094] [2022-12-12 14:30:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:50,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:30:51,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:51,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041610094] [2022-12-12 14:30:51,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041610094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:51,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:51,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:30:51,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309831299] [2022-12-12 14:30:51,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:51,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:30:51,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:51,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:30:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:30:51,017 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 14:30:51,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-12 14:30:51,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:51,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 14:30:51,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:51,464 INFO L130 PetriNetUnfolder]: 2047/3212 cut-off events. [2022-12-12 14:30:51,465 INFO L131 PetriNetUnfolder]: For 7031/7474 co-relation queries the response was YES. [2022-12-12 14:30:51,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10552 conditions, 3212 events. 2047/3212 cut-off events. For 7031/7474 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 17076 event pairs, 551 based on Foata normal form. 98/2730 useless extension candidates. Maximal degree in co-relation 10532. Up to 2459 conditions per place. [2022-12-12 14:30:51,488 INFO L137 encePairwiseOnDemand]: 58/62 looper letters, 61 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2022-12-12 14:30:51,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 84 transitions, 575 flow [2022-12-12 14:30:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:30:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:30:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-12 14:30:51,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36693548387096775 [2022-12-12 14:30:51,490 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 344 flow. Second operand 4 states and 91 transitions. [2022-12-12 14:30:51,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 84 transitions, 575 flow [2022-12-12 14:30:51,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 544 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-12 14:30:51,504 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 346 flow [2022-12-12 14:30:51,504 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=346, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2022-12-12 14:30:51,506 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -11 predicate places. [2022-12-12 14:30:51,507 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 346 flow [2022-12-12 14:30:51,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-12 14:30:51,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:51,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:51,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:30:51,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:51,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1401580220, now seen corresponding path program 1 times [2022-12-12 14:30:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:51,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3397131] [2022-12-12 14:30:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:51,943 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-12 14:30:51,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:51,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3397131] [2022-12-12 14:30:51,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3397131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:51,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:51,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:30:51,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281790062] [2022-12-12 14:30:51,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:51,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:30:51,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:51,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:30:51,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:30:51,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 14:30:51,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 346 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-12 14:30:51,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:51,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 14:30:51,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:52,424 INFO L130 PetriNetUnfolder]: 2357/3706 cut-off events. [2022-12-12 14:30:52,425 INFO L131 PetriNetUnfolder]: For 8220/8420 co-relation queries the response was YES. [2022-12-12 14:30:52,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12202 conditions, 3706 events. 2357/3706 cut-off events. For 8220/8420 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19843 event pairs, 1421 based on Foata normal form. 40/3158 useless extension candidates. Maximal degree in co-relation 12180. Up to 2775 conditions per place. [2022-12-12 14:30:52,455 INFO L137 encePairwiseOnDemand]: 54/62 looper letters, 50 selfloop transitions, 22 changer transitions 0/86 dead transitions. [2022-12-12 14:30:52,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 603 flow [2022-12-12 14:30:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:30:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:30:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-12 14:30:52,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2022-12-12 14:30:52,457 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 346 flow. Second operand 5 states and 104 transitions. [2022-12-12 14:30:52,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 603 flow [2022-12-12 14:30:52,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 585 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-12 14:30:52,466 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 476 flow [2022-12-12 14:30:52,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=64, PETRI_TRANSITIONS=69} [2022-12-12 14:30:52,467 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -7 predicate places. [2022-12-12 14:30:52,467 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 476 flow [2022-12-12 14:30:52,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-12 14:30:52,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:52,467 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:52,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:30:52,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:52,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:52,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1941333322, now seen corresponding path program 2 times [2022-12-12 14:30:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:52,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28959354] [2022-12-12 14:30:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:52,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:52,761 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-12 14:30:52,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:52,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28959354] [2022-12-12 14:30:52,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28959354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:52,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:52,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:30:52,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174784687] [2022-12-12 14:30:52,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:52,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:30:52,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:52,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:30:52,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:30:52,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 14:30:52,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 69 transitions, 476 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:30:52,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:52,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 14:30:52,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:53,260 INFO L130 PetriNetUnfolder]: 2330/3703 cut-off events. [2022-12-12 14:30:53,260 INFO L131 PetriNetUnfolder]: For 13879/14444 co-relation queries the response was YES. [2022-12-12 14:30:53,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13983 conditions, 3703 events. 2330/3703 cut-off events. For 13879/14444 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20578 event pairs, 539 based on Foata normal form. 142/3238 useless extension candidates. Maximal degree in co-relation 13959. Up to 2489 conditions per place. [2022-12-12 14:30:53,291 INFO L137 encePairwiseOnDemand]: 54/62 looper letters, 60 selfloop transitions, 32 changer transitions 0/106 dead transitions. [2022-12-12 14:30:53,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 106 transitions, 817 flow [2022-12-12 14:30:53,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:30:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:30:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-12 14:30:53,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2022-12-12 14:30:53,293 INFO L175 Difference]: Start difference. First operand has 64 places, 69 transitions, 476 flow. Second operand 6 states and 126 transitions. [2022-12-12 14:30:53,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 106 transitions, 817 flow [2022-12-12 14:30:53,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 782 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-12 14:30:53,313 INFO L231 Difference]: Finished difference. Result has 69 places, 78 transitions, 604 flow [2022-12-12 14:30:53,314 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=69, PETRI_TRANSITIONS=78} [2022-12-12 14:30:53,316 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -2 predicate places. [2022-12-12 14:30:53,316 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 78 transitions, 604 flow [2022-12-12 14:30:53,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:30:53,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:53,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:53,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:30:53,317 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:53,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash -85568830, now seen corresponding path program 3 times [2022-12-12 14:30:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:53,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390927914] [2022-12-12 14:30:53,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:53,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:53,948 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-12 14:30:53,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:53,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390927914] [2022-12-12 14:30:53,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390927914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:53,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:53,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:30:53,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118315814] [2022-12-12 14:30:53,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:53,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:30:53,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:53,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:30:53,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:30:53,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 62 [2022-12-12 14:30:53,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 78 transitions, 604 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-12 14:30:53,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:53,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 62 [2022-12-12 14:30:53,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:54,614 INFO L130 PetriNetUnfolder]: 2813/4269 cut-off events. [2022-12-12 14:30:54,614 INFO L131 PetriNetUnfolder]: For 14977/14977 co-relation queries the response was YES. [2022-12-12 14:30:54,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17144 conditions, 4269 events. 2813/4269 cut-off events. For 14977/14977 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21877 event pairs, 505 based on Foata normal form. 10/3727 useless extension candidates. Maximal degree in co-relation 17118. Up to 3520 conditions per place. [2022-12-12 14:30:54,647 INFO L137 encePairwiseOnDemand]: 51/62 looper letters, 104 selfloop transitions, 40 changer transitions 0/152 dead transitions. [2022-12-12 14:30:54,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 152 transitions, 1274 flow [2022-12-12 14:30:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:30:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:30:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2022-12-12 14:30:54,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3456221198156682 [2022-12-12 14:30:54,649 INFO L175 Difference]: Start difference. First operand has 69 places, 78 transitions, 604 flow. Second operand 7 states and 150 transitions. [2022-12-12 14:30:54,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 152 transitions, 1274 flow [2022-12-12 14:30:54,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 152 transitions, 1254 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-12 14:30:54,677 INFO L231 Difference]: Finished difference. Result has 77 places, 100 transitions, 931 flow [2022-12-12 14:30:54,678 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=931, PETRI_PLACES=77, PETRI_TRANSITIONS=100} [2022-12-12 14:30:54,678 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 6 predicate places. [2022-12-12 14:30:54,678 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 100 transitions, 931 flow [2022-12-12 14:30:54,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-12 14:30:54,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:54,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:54,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:30:54,679 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:54,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:54,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1488318530, now seen corresponding path program 4 times [2022-12-12 14:30:54,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:54,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247456067] [2022-12-12 14:30:54,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:54,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:55,025 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-12 14:30:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:55,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247456067] [2022-12-12 14:30:55,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247456067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:55,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:55,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:30:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900414616] [2022-12-12 14:30:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:55,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:30:55,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:30:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:30:55,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 14:30:55,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 100 transitions, 931 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-12 14:30:55,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:55,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 14:30:55,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:55,460 INFO L130 PetriNetUnfolder]: 2430/3878 cut-off events. [2022-12-12 14:30:55,460 INFO L131 PetriNetUnfolder]: For 22090/22470 co-relation queries the response was YES. [2022-12-12 14:30:55,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17662 conditions, 3878 events. 2430/3878 cut-off events. For 22090/22470 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21862 event pairs, 481 based on Foata normal form. 144/3412 useless extension candidates. Maximal degree in co-relation 17632. Up to 2507 conditions per place. [2022-12-12 14:30:55,496 INFO L137 encePairwiseOnDemand]: 55/62 looper letters, 64 selfloop transitions, 47 changer transitions 0/131 dead transitions. [2022-12-12 14:30:55,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 131 transitions, 1281 flow [2022-12-12 14:30:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:30:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:30:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-12 14:30:55,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2022-12-12 14:30:55,497 INFO L175 Difference]: Start difference. First operand has 77 places, 100 transitions, 931 flow. Second operand 6 states and 126 transitions. [2022-12-12 14:30:55,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 131 transitions, 1281 flow [2022-12-12 14:30:55,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 131 transitions, 1237 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-12 14:30:55,535 INFO L231 Difference]: Finished difference. Result has 82 places, 103 transitions, 1052 flow [2022-12-12 14:30:55,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1052, PETRI_PLACES=82, PETRI_TRANSITIONS=103} [2022-12-12 14:30:55,536 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 11 predicate places. [2022-12-12 14:30:55,536 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 103 transitions, 1052 flow [2022-12-12 14:30:55,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-12 14:30:55,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:55,536 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:55,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:30:55,537 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:55,537 INFO L85 PathProgramCache]: Analyzing trace with hash -894003056, now seen corresponding path program 1 times [2022-12-12 14:30:55,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:55,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060054095] [2022-12-12 14:30:55,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:55,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:55,827 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-12 14:30:55,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:55,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060054095] [2022-12-12 14:30:55,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060054095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:55,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:55,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:30:55,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493811432] [2022-12-12 14:30:55,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:55,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:30:55,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:55,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:30:55,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:30:55,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 62 [2022-12-12 14:30:55,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 103 transitions, 1052 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-12 14:30:55,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:55,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 62 [2022-12-12 14:30:55,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:56,562 INFO L130 PetriNetUnfolder]: 4138/6410 cut-off events. [2022-12-12 14:30:56,562 INFO L131 PetriNetUnfolder]: For 41093/41093 co-relation queries the response was YES. [2022-12-12 14:30:56,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29705 conditions, 6410 events. 4138/6410 cut-off events. For 41093/41093 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 36696 event pairs, 407 based on Foata normal form. 114/5593 useless extension candidates. Maximal degree in co-relation 29673. Up to 3205 conditions per place. [2022-12-12 14:30:56,597 INFO L137 encePairwiseOnDemand]: 54/62 looper letters, 159 selfloop transitions, 16 changer transitions 42/225 dead transitions. [2022-12-12 14:30:56,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 225 transitions, 2747 flow [2022-12-12 14:30:56,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:30:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:30:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-12-12 14:30:56,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31989247311827956 [2022-12-12 14:30:56,599 INFO L175 Difference]: Start difference. First operand has 82 places, 103 transitions, 1052 flow. Second operand 6 states and 119 transitions. [2022-12-12 14:30:56,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 225 transitions, 2747 flow [2022-12-12 14:30:56,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 225 transitions, 2562 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-12 14:30:56,663 INFO L231 Difference]: Finished difference. Result has 86 places, 116 transitions, 1182 flow [2022-12-12 14:30:56,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1182, PETRI_PLACES=86, PETRI_TRANSITIONS=116} [2022-12-12 14:30:56,663 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places. [2022-12-12 14:30:56,664 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 116 transitions, 1182 flow [2022-12-12 14:30:56,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-12 14:30:56,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:56,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:56,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:30:56,664 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 363503666, now seen corresponding path program 2 times [2022-12-12 14:30:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:56,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139267428] [2022-12-12 14:30:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:56,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:56,768 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-12 14:30:56,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:56,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139267428] [2022-12-12 14:30:56,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139267428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:56,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:56,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:30:56,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916902418] [2022-12-12 14:30:56,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:56,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:30:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:56,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:30:56,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:30:56,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 62 [2022-12-12 14:30:56,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 116 transitions, 1182 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-12 14:30:56,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:56,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 62 [2022-12-12 14:30:56,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:57,579 INFO L130 PetriNetUnfolder]: 4991/7875 cut-off events. [2022-12-12 14:30:57,580 INFO L131 PetriNetUnfolder]: For 55047/56711 co-relation queries the response was YES. [2022-12-12 14:30:57,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33756 conditions, 7875 events. 4991/7875 cut-off events. For 55047/56711 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 52095 event pairs, 1321 based on Foata normal form. 1367/6713 useless extension candidates. Maximal degree in co-relation 33721. Up to 5566 conditions per place. [2022-12-12 14:30:57,621 INFO L137 encePairwiseOnDemand]: 50/62 looper letters, 118 selfloop transitions, 17 changer transitions 32/190 dead transitions. [2022-12-12 14:30:57,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 190 transitions, 2126 flow [2022-12-12 14:30:57,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:30:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:30:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-12-12 14:30:57,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2022-12-12 14:30:57,623 INFO L175 Difference]: Start difference. First operand has 86 places, 116 transitions, 1182 flow. Second operand 5 states and 121 transitions. [2022-12-12 14:30:57,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 190 transitions, 2126 flow [2022-12-12 14:30:57,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 190 transitions, 2112 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-12 14:30:57,677 INFO L231 Difference]: Finished difference. Result has 91 places, 102 transitions, 996 flow [2022-12-12 14:30:57,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=996, PETRI_PLACES=91, PETRI_TRANSITIONS=102} [2022-12-12 14:30:57,678 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 20 predicate places. [2022-12-12 14:30:57,678 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 102 transitions, 996 flow [2022-12-12 14:30:57,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-12 14:30:57,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:57,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:57,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:30:57,679 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:57,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1678650077, now seen corresponding path program 1 times [2022-12-12 14:30:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:57,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299558497] [2022-12-12 14:30:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:57,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:57,805 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-12 14:30:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:57,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299558497] [2022-12-12 14:30:57,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299558497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:57,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:57,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:30:57,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487962545] [2022-12-12 14:30:57,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:57,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:30:57,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:57,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:30:57,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:30:57,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 62 [2022-12-12 14:30:57,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 102 transitions, 996 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-12 14:30:57,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:57,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 62 [2022-12-12 14:30:57,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:58,503 INFO L130 PetriNetUnfolder]: 3376/5873 cut-off events. [2022-12-12 14:30:58,504 INFO L131 PetriNetUnfolder]: For 44912/46562 co-relation queries the response was YES. [2022-12-12 14:30:58,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29951 conditions, 5873 events. 3376/5873 cut-off events. For 44912/46562 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 42417 event pairs, 271 based on Foata normal form. 1062/5041 useless extension candidates. Maximal degree in co-relation 29912. Up to 2873 conditions per place. [2022-12-12 14:30:58,602 INFO L137 encePairwiseOnDemand]: 50/62 looper letters, 112 selfloop transitions, 33 changer transitions 39/207 dead transitions. [2022-12-12 14:30:58,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 207 transitions, 2374 flow [2022-12-12 14:30:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:30:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:30:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2022-12-12 14:30:58,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38940092165898615 [2022-12-12 14:30:58,605 INFO L175 Difference]: Start difference. First operand has 91 places, 102 transitions, 996 flow. Second operand 7 states and 169 transitions. [2022-12-12 14:30:58,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 207 transitions, 2374 flow [2022-12-12 14:30:58,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 207 transitions, 2201 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-12 14:30:58,656 INFO L231 Difference]: Finished difference. Result has 93 places, 109 transitions, 1036 flow [2022-12-12 14:30:58,656 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1036, PETRI_PLACES=93, PETRI_TRANSITIONS=109} [2022-12-12 14:30:58,657 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 22 predicate places. [2022-12-12 14:30:58,657 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 109 transitions, 1036 flow [2022-12-12 14:30:58,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-12 14:30:58,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:58,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:58,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 14:30:58,658 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:58,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash 293541091, now seen corresponding path program 1 times [2022-12-12 14:30:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:58,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703370082] [2022-12-12 14:30:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:58,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:58,804 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-12 14:30:58,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:58,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703370082] [2022-12-12 14:30:58,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703370082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:58,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:58,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:30:58,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990434647] [2022-12-12 14:30:58,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:58,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:30:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:58,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:30:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:30:58,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 62 [2022-12-12 14:30:58,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 109 transitions, 1036 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-12 14:30:58,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:58,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 62 [2022-12-12 14:30:58,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:30:59,431 INFO L130 PetriNetUnfolder]: 2395/4451 cut-off events. [2022-12-12 14:30:59,431 INFO L131 PetriNetUnfolder]: For 30966/32416 co-relation queries the response was YES. [2022-12-12 14:30:59,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24700 conditions, 4451 events. 2395/4451 cut-off events. For 30966/32416 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 33134 event pairs, 82 based on Foata normal form. 661/3742 useless extension candidates. Maximal degree in co-relation 24661. Up to 2135 conditions per place. [2022-12-12 14:30:59,447 INFO L137 encePairwiseOnDemand]: 50/62 looper letters, 68 selfloop transitions, 43 changer transitions 77/203 dead transitions. [2022-12-12 14:30:59,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 203 transitions, 2317 flow [2022-12-12 14:30:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 14:30:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 14:30:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2022-12-12 14:30:59,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33154121863799285 [2022-12-12 14:30:59,456 INFO L175 Difference]: Start difference. First operand has 93 places, 109 transitions, 1036 flow. Second operand 9 states and 185 transitions. [2022-12-12 14:30:59,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 203 transitions, 2317 flow [2022-12-12 14:30:59,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 203 transitions, 2138 flow, removed 43 selfloop flow, removed 5 redundant places. [2022-12-12 14:30:59,574 INFO L231 Difference]: Finished difference. Result has 99 places, 87 transitions, 780 flow [2022-12-12 14:30:59,574 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=780, PETRI_PLACES=99, PETRI_TRANSITIONS=87} [2022-12-12 14:30:59,575 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 28 predicate places. [2022-12-12 14:30:59,575 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 87 transitions, 780 flow [2022-12-12 14:30:59,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-12 14:30:59,575 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:59,575 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:59,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 14:30:59,576 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:30:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:59,576 INFO L85 PathProgramCache]: Analyzing trace with hash 238578927, now seen corresponding path program 1 times [2022-12-12 14:30:59,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:59,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426086866] [2022-12-12 14:30:59,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:59,738 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-12 14:30:59,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:59,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426086866] [2022-12-12 14:30:59,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426086866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:59,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:59,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:30:59,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678282548] [2022-12-12 14:30:59,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:59,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:30:59,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:59,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:30:59,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:30:59,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 14:30:59,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 87 transitions, 780 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-12 14:30:59,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:59,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 14:30:59,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:00,159 INFO L130 PetriNetUnfolder]: 1581/3144 cut-off events. [2022-12-12 14:31:00,160 INFO L131 PetriNetUnfolder]: For 17120/17550 co-relation queries the response was YES. [2022-12-12 14:31:00,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17011 conditions, 3144 events. 1581/3144 cut-off events. For 17120/17550 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 22828 event pairs, 272 based on Foata normal form. 228/2894 useless extension candidates. Maximal degree in co-relation 16970. Up to 1501 conditions per place. [2022-12-12 14:31:00,174 INFO L137 encePairwiseOnDemand]: 59/62 looper letters, 53 selfloop transitions, 1 changer transitions 88/158 dead transitions. [2022-12-12 14:31:00,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 158 transitions, 1691 flow [2022-12-12 14:31:00,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:31:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:31:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-12 14:31:00,176 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-12 14:31:00,176 INFO L175 Difference]: Start difference. First operand has 99 places, 87 transitions, 780 flow. Second operand 4 states and 93 transitions. [2022-12-12 14:31:00,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 158 transitions, 1691 flow [2022-12-12 14:31:00,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 158 transitions, 1326 flow, removed 75 selfloop flow, removed 18 redundant places. [2022-12-12 14:31:00,271 INFO L231 Difference]: Finished difference. Result has 82 places, 58 transitions, 372 flow [2022-12-12 14:31:00,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=82, PETRI_TRANSITIONS=58} [2022-12-12 14:31:00,271 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 11 predicate places. [2022-12-12 14:31:00,272 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 58 transitions, 372 flow [2022-12-12 14:31:00,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-12 14:31:00,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:00,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:00,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 14:31:00,272 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:31:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash -276956607, now seen corresponding path program 1 times [2022-12-12 14:31:00,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:00,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956807810] [2022-12-12 14:31:00,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:00,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:31:00,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:31:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:31:00,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:31:00,446 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:31:00,448 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 14:31:00,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 14:31:00,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 14:31:00,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 14:31:00,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 14:31:00,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 14:31:00,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 14:31:00,450 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:00,455 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:31:00,456 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:31:00,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:31:00 BasicIcfg [2022-12-12 14:31:00,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:31:00,527 INFO L158 Benchmark]: Toolchain (without parser) took 26077.78ms. Allocated memory was 177.2MB in the beginning and 1.1GB in the end (delta: 942.7MB). Free memory was 140.6MB in the beginning and 1.0GB in the end (delta: -886.8MB). Peak memory consumption was 487.2MB. Max. memory is 8.0GB. [2022-12-12 14:31:00,527 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:31:00,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.16ms. Allocated memory is still 177.2MB. Free memory was 140.2MB in the beginning and 146.7MB in the end (delta: -6.5MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. [2022-12-12 14:31:00,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.07ms. Allocated memory is still 177.2MB. Free memory was 146.2MB in the beginning and 143.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:31:00,528 INFO L158 Benchmark]: Boogie Preprocessor took 38.49ms. Allocated memory is still 177.2MB. Free memory was 143.6MB in the beginning and 141.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:31:00,528 INFO L158 Benchmark]: RCFGBuilder took 716.80ms. Allocated memory is still 177.2MB. Free memory was 141.9MB in the beginning and 127.0MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-12 14:31:00,528 INFO L158 Benchmark]: TraceAbstraction took 24678.08ms. Allocated memory was 177.2MB in the beginning and 1.1GB in the end (delta: 942.7MB). Free memory was 125.9MB in the beginning and 1.0GB in the end (delta: -901.4MB). Peak memory consumption was 474.3MB. Max. memory is 8.0GB. [2022-12-12 14:31:00,529 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 585.16ms. Allocated memory is still 177.2MB. Free memory was 140.2MB in the beginning and 146.7MB in the end (delta: -6.5MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.07ms. Allocated memory is still 177.2MB. Free memory was 146.2MB in the beginning and 143.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.49ms. Allocated memory is still 177.2MB. Free memory was 143.6MB in the beginning and 141.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 716.80ms. Allocated memory is still 177.2MB. Free memory was 141.9MB in the beginning and 127.0MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 24678.08ms. Allocated memory was 177.2MB in the beginning and 1.1GB in the end (delta: 942.7MB). Free memory was 125.9MB in the beginning and 1.0GB in the end (delta: -901.4MB). Peak memory consumption was 474.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 115 PlacesBefore, 71 PlacesAfterwards, 107 TransitionsBefore, 62 TransitionsAfterwards, 1994 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 3678, independent unconditional: 0, dependent: 131, dependent conditional: 131, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 0, independent unconditional: 3678, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 0, independent unconditional: 3678, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 0, independent unconditional: 3678, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2040, independent: 1976, independent conditional: 0, independent unconditional: 1976, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2040, independent: 1939, independent conditional: 0, independent unconditional: 1939, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 343, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 292, dependent conditional: 0, dependent unconditional: 292, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3809, independent: 1702, independent conditional: 0, independent unconditional: 1702, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 2040, unknown conditional: 0, unknown unconditional: 2040] , Statistics on independence cache: Total cache size (in pairs): 3738, Positive cache size: 3674, Positive conditional cache size: 0, Positive unconditional cache size: 3674, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-3, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=-2, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=-1, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 614 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 614 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1559 IncrementalHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 30 mSDtfsCounter, 1559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1182occurred in iteration=11, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 2193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 14:31:00,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...