/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 --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:37:38,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:37:38,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:37:38,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:37:38,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:37:38,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:37:38,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:37:38,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:37:38,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:37:38,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:37:38,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:37:38,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:37:38,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:37:38,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:37:38,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:37:38,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:37:38,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:37:38,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:37:38,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:37:38,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:37:38,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:37:38,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:37:38,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:37:38,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:37:38,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:37:38,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:37:38,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:37:38,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:37:38,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:37:38,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:37:38,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:37:38,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:37:38,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:37:38,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:37:38,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:37:38,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:37:38,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:37:38,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:37:38,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:37:38,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:37:38,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:37:38,521 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 21:37:38,551 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:37:38,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:37:38,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:37:38,553 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:37:38,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:37:38,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:37:38,554 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:37:38,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:37:38,555 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:37:38,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:37:38,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:37:38,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:37:38,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:37:38,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:37:38,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:37:38,557 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:37:38,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:37:38,557 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:37:38,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:37:38,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:37:38,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:37:38,557 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:37:38,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:37:38,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:37:38,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:37:38,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:37:38,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:37:38,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:37:38,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:37:38,559 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:37:38,559 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:37:38,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:37:38,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:37:38,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:37:38,914 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:37:38,914 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:37:38,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2022-12-12 21:37:40,145 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:37:40,402 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:37:40,403 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2022-12-12 21:37:40,418 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870e3e971/2585536226f14645a417dfd18f50e02e/FLAG93366cfb3 [2022-12-12 21:37:40,435 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870e3e971/2585536226f14645a417dfd18f50e02e [2022-12-12 21:37:40,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:37:40,438 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:37:40,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:37:40,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:37:40,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:37:40,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:37:40" (1/1) ... [2022-12-12 21:37:40,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10fedefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:40, skipping insertion in model container [2022-12-12 21:37:40,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:37:40" (1/1) ... [2022-12-12 21:37:40,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:37:40,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:37:40,627 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/mix043.oepc.i[945,958] [2022-12-12 21:37:40,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:37:40,874 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:37:40,887 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/mix043.oepc.i[945,958] [2022-12-12 21:37:40,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:37:40,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:37:40,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:37:41,023 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:37:41,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41 WrapperNode [2022-12-12 21:37:41,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:37:41,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:37:41,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:37:41,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:37:41,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (1/1) ... [2022-12-12 21:37:41,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (1/1) ... [2022-12-12 21:37:41,093 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-12 21:37:41,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:37:41,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:37:41,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:37:41,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:37:41,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (1/1) ... [2022-12-12 21:37:41,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (1/1) ... [2022-12-12 21:37:41,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (1/1) ... [2022-12-12 21:37:41,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (1/1) ... [2022-12-12 21:37:41,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (1/1) ... [2022-12-12 21:37:41,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (1/1) ... [2022-12-12 21:37:41,146 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (1/1) ... [2022-12-12 21:37:41,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (1/1) ... [2022-12-12 21:37:41,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:37:41,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:37:41,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:37:41,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:37:41,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (1/1) ... [2022-12-12 21:37:41,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:37:41,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:37:41,209 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 21:37:41,227 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 21:37:41,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:37:41,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:37:41,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:37:41,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:37:41,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:37:41,256 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:37:41,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:37:41,257 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:37:41,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:37:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:37:41,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:37:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 21:37:41,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 21:37:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:37:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:37:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:37:41,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:37:41,260 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 21:37:41,420 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:37:41,436 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:37:41,706 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:37:41,851 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:37:41,851 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:37:41,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:37:41 BoogieIcfgContainer [2022-12-12 21:37:41,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:37:41,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:37:41,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:37:41,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:37:41,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:37:40" (1/3) ... [2022-12-12 21:37:41,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304e3edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:37:41, skipping insertion in model container [2022-12-12 21:37:41,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:37:41" (2/3) ... [2022-12-12 21:37:41,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304e3edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:37:41, skipping insertion in model container [2022-12-12 21:37:41,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:37:41" (3/3) ... [2022-12-12 21:37:41,861 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2022-12-12 21:37:41,879 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:37:41,879 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:37:41,879 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:37:41,971 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:37:42,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-12-12 21:37:42,076 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-12 21:37:42,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:37:42,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-12 21:37:42,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-12-12 21:37:42,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-12-12 21:37:42,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:37:42,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-12 21:37:42,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-12-12 21:37:42,191 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-12 21:37:42,191 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:37:42,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-12 21:37:42,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-12 21:37:42,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 3270 [2022-12-12 21:37:48,551 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-12 21:37:48,580 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:37:48,587 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;@1d1e3cd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:37:48,587 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 21:37:48,590 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-12 21:37:48,590 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:37:48,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:48,591 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 21:37:48,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:48,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:48,596 INFO L85 PathProgramCache]: Analyzing trace with hash 598554, now seen corresponding path program 1 times [2022-12-12 21:37:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:48,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039643930] [2022-12-12 21:37:48,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:48,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:49,050 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 21:37:49,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:49,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039643930] [2022-12-12 21:37:49,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039643930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:49,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:49,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:37:49,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342320604] [2022-12-12 21:37:49,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:49,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:37:49,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:49,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:37:49,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:37:49,090 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 85 [2022-12-12 21:37:49,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 85 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 21:37:49,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:49,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 85 [2022-12-12 21:37:49,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:58,392 INFO L130 PetriNetUnfolder]: 78140/109416 cut-off events. [2022-12-12 21:37:58,392 INFO L131 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2022-12-12 21:37:58,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212430 conditions, 109416 events. 78140/109416 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 4919. Compared 794710 event pairs, 41427 based on Foata normal form. 0/67090 useless extension candidates. Maximal degree in co-relation 212418. Up to 86085 conditions per place. [2022-12-12 21:37:58,760 INFO L137 encePairwiseOnDemand]: 79/85 looper letters, 50 selfloop transitions, 2 changer transitions 71/139 dead transitions. [2022-12-12 21:37:58,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 139 transitions, 543 flow [2022-12-12 21:37:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:37:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:37:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2022-12-12 21:37:58,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2022-12-12 21:37:58,775 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, -1 predicate places. [2022-12-12 21:37:58,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 139 transitions, 543 flow [2022-12-12 21:37:58,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 68 transitions, 261 flow [2022-12-12 21:37:58,919 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 68 transitions, 261 flow [2022-12-12 21:37:58,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 21:37:58,920 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:58,920 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:58,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:37:58,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:58,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash 24868128, now seen corresponding path program 1 times [2022-12-12 21:37:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:58,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584321637] [2022-12-12 21:37:58,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:58,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:59,248 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 21:37:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:59,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584321637] [2022-12-12 21:37:59,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584321637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:59,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:59,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:37:59,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637701262] [2022-12-12 21:37:59,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:59,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:37:59,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:59,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:37:59,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:37:59,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 85 [2022-12-12 21:37:59,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 68 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 21:37:59,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:59,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 85 [2022-12-12 21:37:59,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:38:04,038 INFO L130 PetriNetUnfolder]: 45443/62862 cut-off events. [2022-12-12 21:38:04,038 INFO L131 PetriNetUnfolder]: For 7746/7746 co-relation queries the response was YES. [2022-12-12 21:38:04,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173565 conditions, 62862 events. 45443/62862 cut-off events. For 7746/7746 co-relation queries the response was YES. Maximal size of possible extension queue 2070. Compared 397031 event pairs, 8927 based on Foata normal form. 1160/52468 useless extension candidates. Maximal degree in co-relation 173550. Up to 43007 conditions per place. [2022-12-12 21:38:04,422 INFO L137 encePairwiseOnDemand]: 76/85 looper letters, 95 selfloop transitions, 11 changer transitions 2/119 dead transitions. [2022-12-12 21:38:04,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 119 transitions, 686 flow [2022-12-12 21:38:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:38:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:38:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-12-12 21:38:04,428 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-12 21:38:04,428 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, -35 predicate places. [2022-12-12 21:38:04,429 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 119 transitions, 686 flow [2022-12-12 21:38:04,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 117 transitions, 678 flow [2022-12-12 21:38:04,657 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 117 transitions, 678 flow [2022-12-12 21:38:04,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 21:38:04,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:38:04,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:38:04,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:38:04,658 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:38:04,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:38:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash 770912674, now seen corresponding path program 1 times [2022-12-12 21:38:04,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:38:04,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419504716] [2022-12-12 21:38:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:38:04,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:38:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:38:04,849 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 21:38:04,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:38:04,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419504716] [2022-12-12 21:38:04,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419504716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:38:04,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:38:04,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:38:04,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442346135] [2022-12-12 21:38:04,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:38:04,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:38:04,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:38:04,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:38:04,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:38:04,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 85 [2022-12-12 21:38:04,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 117 transitions, 678 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 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 21:38:04,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:38:04,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 85 [2022-12-12 21:38:04,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:38:08,269 INFO L130 PetriNetUnfolder]: 32759/45870 cut-off events. [2022-12-12 21:38:08,270 INFO L131 PetriNetUnfolder]: For 4845/4845 co-relation queries the response was YES. [2022-12-12 21:38:08,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172562 conditions, 45870 events. 32759/45870 cut-off events. For 4845/4845 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 282771 event pairs, 2312 based on Foata normal form. 624/38064 useless extension candidates. Maximal degree in co-relation 172544. Up to 33047 conditions per place. [2022-12-12 21:38:08,532 INFO L137 encePairwiseOnDemand]: 78/85 looper letters, 145 selfloop transitions, 8 changer transitions 4/168 dead transitions. [2022-12-12 21:38:08,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 168 transitions, 1288 flow [2022-12-12 21:38:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:38:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:38:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-12-12 21:38:08,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34705882352941175 [2022-12-12 21:38:08,535 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, -33 predicate places. [2022-12-12 21:38:08,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 168 transitions, 1288 flow [2022-12-12 21:38:08,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 164 transitions, 1256 flow [2022-12-12 21:38:08,713 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 164 transitions, 1256 flow [2022-12-12 21:38:08,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 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 21:38:08,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:38:08,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:38:08,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:38:08,714 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:38:08,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:38:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1871513865, now seen corresponding path program 1 times [2022-12-12 21:38:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:38:08,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834322734] [2022-12-12 21:38:08,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:38:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:38:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:38:08,967 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 21:38:08,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:38:08,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834322734] [2022-12-12 21:38:08,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834322734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:38:08,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:38:08,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:38:08,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465621249] [2022-12-12 21:38:08,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:38:08,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:38:08,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:38:08,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:38:08,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:38:08,972 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 85 [2022-12-12 21:38:08,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 164 transitions, 1256 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 21:38:08,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:38:08,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 85 [2022-12-12 21:38:08,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:38:13,970 INFO L130 PetriNetUnfolder]: 48111/65593 cut-off events. [2022-12-12 21:38:13,971 INFO L131 PetriNetUnfolder]: For 57807/58845 co-relation queries the response was YES. [2022-12-12 21:38:14,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290201 conditions, 65593 events. 48111/65593 cut-off events. For 57807/58845 co-relation queries the response was YES. Maximal size of possible extension queue 2215. Compared 398859 event pairs, 5459 based on Foata normal form. 705/56713 useless extension candidates. Maximal degree in co-relation 290180. Up to 57588 conditions per place. [2022-12-12 21:38:14,402 INFO L137 encePairwiseOnDemand]: 71/85 looper letters, 205 selfloop transitions, 53 changer transitions 0/278 dead transitions. [2022-12-12 21:38:14,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 278 transitions, 2681 flow [2022-12-12 21:38:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:38:14,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:38:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-12-12 21:38:14,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2022-12-12 21:38:14,405 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, -32 predicate places. [2022-12-12 21:38:14,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 278 transitions, 2681 flow [2022-12-12 21:38:14,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 278 transitions, 2681 flow [2022-12-12 21:38:14,661 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 278 transitions, 2681 flow [2022-12-12 21:38:14,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 21:38:14,662 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:38:14,662 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:38:14,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:38:14,662 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:38:14,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:38:14,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1377018402, now seen corresponding path program 1 times [2022-12-12 21:38:14,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:38:14,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414444663] [2022-12-12 21:38:14,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:38:14,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:38:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:38:15,134 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 21:38:15,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:38:15,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414444663] [2022-12-12 21:38:15,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414444663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:38:15,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:38:15,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:38:15,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137774306] [2022-12-12 21:38:15,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:38:15,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:38:15,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:38:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:38:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:38:15,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 85 [2022-12-12 21:38:15,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 278 transitions, 2681 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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 21:38:15,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:38:15,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 85 [2022-12-12 21:38:15,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:38:18,965 INFO L130 PetriNetUnfolder]: 30453/43757 cut-off events. [2022-12-12 21:38:18,966 INFO L131 PetriNetUnfolder]: For 50598/52324 co-relation queries the response was YES. [2022-12-12 21:38:19,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233262 conditions, 43757 events. 30453/43757 cut-off events. For 50598/52324 co-relation queries the response was YES. Maximal size of possible extension queue 1658. Compared 284705 event pairs, 2316 based on Foata normal form. 2410/39866 useless extension candidates. Maximal degree in co-relation 233238. Up to 37856 conditions per place. [2022-12-12 21:38:19,397 INFO L137 encePairwiseOnDemand]: 71/85 looper letters, 248 selfloop transitions, 105 changer transitions 0/373 dead transitions. [2022-12-12 21:38:19,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 373 transitions, 4328 flow [2022-12-12 21:38:19,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:38:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:38:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2022-12-12 21:38:19,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40294117647058825 [2022-12-12 21:38:19,400 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, -29 predicate places. [2022-12-12 21:38:19,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 373 transitions, 4328 flow [2022-12-12 21:38:19,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 373 transitions, 4328 flow [2022-12-12 21:38:19,581 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 373 transitions, 4328 flow [2022-12-12 21:38:19,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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 21:38:19,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:38:19,582 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:38:19,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:38:19,582 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:38:19,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:38:19,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1731264773, now seen corresponding path program 1 times [2022-12-12 21:38:19,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:38:19,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733975820] [2022-12-12 21:38:19,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:38:19,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:38:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:38:20,123 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 21:38:20,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:38:20,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733975820] [2022-12-12 21:38:20,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733975820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:38:20,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:38:20,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:38:20,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386006061] [2022-12-12 21:38:20,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:38:20,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:38:20,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:38:20,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:38:20,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:38:20,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 85 [2022-12-12 21:38:20,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 373 transitions, 4328 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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 21:38:20,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:38:20,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 85 [2022-12-12 21:38:20,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:38:28,027 INFO L130 PetriNetUnfolder]: 57423/82331 cut-off events. [2022-12-12 21:38:28,028 INFO L131 PetriNetUnfolder]: For 154424/156813 co-relation queries the response was YES. [2022-12-12 21:38:28,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501128 conditions, 82331 events. 57423/82331 cut-off events. For 154424/156813 co-relation queries the response was YES. Maximal size of possible extension queue 3282. Compared 583476 event pairs, 4171 based on Foata normal form. 1182/70824 useless extension candidates. Maximal degree in co-relation 501101. Up to 72283 conditions per place. [2022-12-12 21:38:28,708 INFO L137 encePairwiseOnDemand]: 77/85 looper letters, 541 selfloop transitions, 93 changer transitions 137/803 dead transitions. [2022-12-12 21:38:28,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 803 transitions, 11084 flow [2022-12-12 21:38:28,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:38:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:38:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2022-12-12 21:38:28,710 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3941176470588235 [2022-12-12 21:38:28,711 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, -24 predicate places. [2022-12-12 21:38:28,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 803 transitions, 11084 flow [2022-12-12 21:38:29,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 666 transitions, 9166 flow [2022-12-12 21:38:29,040 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 666 transitions, 9166 flow [2022-12-12 21:38:29,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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 21:38:29,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:38:29,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:38:29,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:38:29,040 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:38:29,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:38:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1585379465, now seen corresponding path program 1 times [2022-12-12 21:38:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:38:29,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407148798] [2022-12-12 21:38:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:38:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:38:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:38:29,282 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 21:38:29,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:38:29,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407148798] [2022-12-12 21:38:29,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407148798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:38:29,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:38:29,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:38:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823382732] [2022-12-12 21:38:29,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:38:29,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:38:29,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:38:29,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:38:29,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:38:29,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 85 [2022-12-12 21:38:29,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 666 transitions, 9166 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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 21:38:29,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:38:29,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 85 [2022-12-12 21:38:29,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:38:34,161 INFO L130 PetriNetUnfolder]: 26343/39892 cut-off events. [2022-12-12 21:38:34,161 INFO L131 PetriNetUnfolder]: For 120717/124258 co-relation queries the response was YES. [2022-12-12 21:38:34,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277214 conditions, 39892 events. 26343/39892 cut-off events. For 120717/124258 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 282668 event pairs, 724 based on Foata normal form. 4376/37976 useless extension candidates. Maximal degree in co-relation 277184. Up to 33567 conditions per place. [2022-12-12 21:38:34,498 INFO L137 encePairwiseOnDemand]: 71/85 looper letters, 410 selfloop transitions, 263 changer transitions 28/721 dead transitions. [2022-12-12 21:38:34,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 721 transitions, 11315 flow [2022-12-12 21:38:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:38:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:38:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2022-12-12 21:38:34,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40705882352941175 [2022-12-12 21:38:34,500 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, -20 predicate places. [2022-12-12 21:38:34,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 721 transitions, 11315 flow [2022-12-12 21:38:34,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 693 transitions, 10867 flow [2022-12-12 21:38:34,856 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 693 transitions, 10867 flow [2022-12-12 21:38:34,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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 21:38:34,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:38:34,857 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, 1, 1] [2022-12-12 21:38:34,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:38:34,857 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:38:34,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:38:34,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1916564072, now seen corresponding path program 1 times [2022-12-12 21:38:34,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:38:34,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438247794] [2022-12-12 21:38:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:38:34,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:38:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:38:35,398 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 21:38:35,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:38:35,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438247794] [2022-12-12 21:38:35,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438247794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:38:35,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:38:35,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:38:35,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162990088] [2022-12-12 21:38:35,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:38:35,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:38:35,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:38:35,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:38:35,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:38:35,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 85 [2022-12-12 21:38:35,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 693 transitions, 10867 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 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 21:38:35,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:38:35,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 85 [2022-12-12 21:38:35,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:38:42,466 INFO L130 PetriNetUnfolder]: 35328/53609 cut-off events. [2022-12-12 21:38:42,466 INFO L131 PetriNetUnfolder]: For 165471/168551 co-relation queries the response was YES. [2022-12-12 21:38:42,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417880 conditions, 53609 events. 35328/53609 cut-off events. For 165471/168551 co-relation queries the response was YES. Maximal size of possible extension queue 1706. Compared 397088 event pairs, 1007 based on Foata normal form. 1142/46346 useless extension candidates. Maximal degree in co-relation 417847. Up to 45235 conditions per place. [2022-12-12 21:38:42,810 INFO L137 encePairwiseOnDemand]: 72/85 looper letters, 703 selfloop transitions, 113 changer transitions 318/1157 dead transitions. [2022-12-12 21:38:42,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 1157 transitions, 20096 flow [2022-12-12 21:38:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 21:38:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 21:38:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 338 transitions. [2022-12-12 21:38:42,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33137254901960783 [2022-12-12 21:38:42,812 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, -11 predicate places. [2022-12-12 21:38:42,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 1157 transitions, 20096 flow [2022-12-12 21:38:43,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 839 transitions, 14623 flow [2022-12-12 21:38:43,038 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 839 transitions, 14623 flow [2022-12-12 21:38:43,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 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 21:38:43,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:38:43,038 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, 1, 1] [2022-12-12 21:38:43,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:38:43,038 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:38:43,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:38:43,039 INFO L85 PathProgramCache]: Analyzing trace with hash 158938162, now seen corresponding path program 1 times [2022-12-12 21:38:43,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:38:43,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408938783] [2022-12-12 21:38:43,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:38:43,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:38:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:38:43,812 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 21:38:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:38:43,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408938783] [2022-12-12 21:38:43,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408938783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:38:43,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:38:43,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:38:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628718553] [2022-12-12 21:38:43,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:38:43,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:38:43,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:38:43,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:38:43,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:38:43,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 85 [2022-12-12 21:38:43,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 839 transitions, 14623 flow. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 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 21:38:43,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:38:43,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 85 [2022-12-12 21:38:43,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:38:52,046 INFO L130 PetriNetUnfolder]: 38048/58843 cut-off events. [2022-12-12 21:38:52,046 INFO L131 PetriNetUnfolder]: For 230447/232981 co-relation queries the response was YES. [2022-12-12 21:38:52,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502439 conditions, 58843 events. 38048/58843 cut-off events. For 230447/232981 co-relation queries the response was YES. Maximal size of possible extension queue 2175. Compared 456402 event pairs, 1282 based on Foata normal form. 722/49932 useless extension candidates. Maximal degree in co-relation 502403. Up to 51121 conditions per place. [2022-12-12 21:38:52,495 INFO L137 encePairwiseOnDemand]: 76/85 looper letters, 863 selfloop transitions, 104 changer transitions 95/1124 dead transitions. [2022-12-12 21:38:52,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 1124 transitions, 21910 flow [2022-12-12 21:38:52,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:38:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:38:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2022-12-12 21:38:52,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40588235294117647 [2022-12-12 21:38:52,497 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, -9 predicate places. [2022-12-12 21:38:52,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 1124 transitions, 21910 flow [2022-12-12 21:38:52,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 1029 transitions, 20010 flow [2022-12-12 21:38:52,802 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 1029 transitions, 20010 flow [2022-12-12 21:38:52,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 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 21:38:52,803 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:38:52,803 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, 1, 1] [2022-12-12 21:38:52,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:38:52,803 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:38:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:38:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1667483509, now seen corresponding path program 1 times [2022-12-12 21:38:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:38:52,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674981662] [2022-12-12 21:38:52,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:38:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:38:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:38:53,312 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 21:38:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:38:53,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674981662] [2022-12-12 21:38:53,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674981662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:38:53,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:38:53,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:38:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247865010] [2022-12-12 21:38:53,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:38:53,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:38:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:38:53,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:38:53,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:38:53,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 85 [2022-12-12 21:38:53,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 1029 transitions, 20010 flow. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 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 21:38:53,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:38:53,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 85 [2022-12-12 21:38:53,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:04,013 INFO L130 PetriNetUnfolder]: 41659/64627 cut-off events. [2022-12-12 21:39:04,014 INFO L131 PetriNetUnfolder]: For 323541/326165 co-relation queries the response was YES. [2022-12-12 21:39:04,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599000 conditions, 64627 events. 41659/64627 cut-off events. For 323541/326165 co-relation queries the response was YES. Maximal size of possible extension queue 2526. Compared 511375 event pairs, 1453 based on Foata normal form. 636/54465 useless extension candidates. Maximal degree in co-relation 598961. Up to 56321 conditions per place. [2022-12-12 21:39:04,571 INFO L137 encePairwiseOnDemand]: 76/85 looper letters, 1021 selfloop transitions, 176 changer transitions 141/1400 dead transitions. [2022-12-12 21:39:04,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 1400 transitions, 30151 flow [2022-12-12 21:39:04,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:39:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:39:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2022-12-12 21:39:04,573 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3563025210084034 [2022-12-12 21:39:04,573 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2022-12-12 21:39:04,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 1400 transitions, 30151 flow [2022-12-12 21:39:05,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 1259 transitions, 27049 flow [2022-12-12 21:39:05,101 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 1259 transitions, 27049 flow [2022-12-12 21:39:05,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 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 21:39:05,101 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:05,101 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, 1, 1] [2022-12-12 21:39:05,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:39:05,101 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash -501692129, now seen corresponding path program 2 times [2022-12-12 21:39:05,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:05,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217017011] [2022-12-12 21:39:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:05,315 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 21:39:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:05,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217017011] [2022-12-12 21:39:05,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217017011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:05,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:05,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:39:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310830323] [2022-12-12 21:39:05,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:05,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:39:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:05,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:39:05,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:39:05,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 85 [2022-12-12 21:39:05,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 1259 transitions, 27049 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 21:39:05,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:05,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 85 [2022-12-12 21:39:05,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:13,527 INFO L130 PetriNetUnfolder]: 30906/45957 cut-off events. [2022-12-12 21:39:13,527 INFO L131 PetriNetUnfolder]: For 312667/317024 co-relation queries the response was YES. [2022-12-12 21:39:13,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462566 conditions, 45957 events. 30906/45957 cut-off events. For 312667/317024 co-relation queries the response was YES. Maximal size of possible extension queue 1721. Compared 322042 event pairs, 450 based on Foata normal form. 4343/41822 useless extension candidates. Maximal degree in co-relation 462524. Up to 38877 conditions per place. [2022-12-12 21:39:13,892 INFO L137 encePairwiseOnDemand]: 71/85 looper letters, 544 selfloop transitions, 411 changer transitions 231/1232 dead transitions. [2022-12-12 21:39:13,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 1232 transitions, 28827 flow [2022-12-12 21:39:13,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:39:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:39:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2022-12-12 21:39:13,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2022-12-12 21:39:13,894 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2022-12-12 21:39:13,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 1232 transitions, 28827 flow [2022-12-12 21:39:14,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 1001 transitions, 23211 flow [2022-12-12 21:39:14,252 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 1001 transitions, 23211 flow [2022-12-12 21:39:14,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 21:39:14,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:14,253 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, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:14,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:39:14,253 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:14,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1715962896, now seen corresponding path program 1 times [2022-12-12 21:39:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:14,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621419133] [2022-12-12 21:39:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:14,464 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 21:39:14,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:14,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621419133] [2022-12-12 21:39:14,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621419133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:14,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:14,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:39:14,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121858489] [2022-12-12 21:39:14,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:14,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:39:14,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:14,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:39:14,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:39:14,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 85 [2022-12-12 21:39:14,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 1001 transitions, 23211 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 21:39:14,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:14,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 85 [2022-12-12 21:39:14,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:24,459 INFO L130 PetriNetUnfolder]: 40554/60980 cut-off events. [2022-12-12 21:39:24,460 INFO L131 PetriNetUnfolder]: For 403346/407566 co-relation queries the response was YES. [2022-12-12 21:39:24,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656013 conditions, 60980 events. 40554/60980 cut-off events. For 403346/407566 co-relation queries the response was YES. Maximal size of possible extension queue 2684. Compared 457194 event pairs, 497 based on Foata normal form. 1051/50165 useless extension candidates. Maximal degree in co-relation 655968. Up to 52220 conditions per place. [2022-12-12 21:39:24,815 INFO L137 encePairwiseOnDemand]: 76/85 looper letters, 913 selfloop transitions, 85 changer transitions 1028/2049 dead transitions. [2022-12-12 21:39:24,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 2049 transitions, 52068 flow [2022-12-12 21:39:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:39:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:39:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2022-12-12 21:39:24,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3509803921568627 [2022-12-12 21:39:24,817 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places. [2022-12-12 21:39:24,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 2049 transitions, 52068 flow [2022-12-12 21:39:25,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 1021 transitions, 25841 flow [2022-12-12 21:39:25,021 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 1021 transitions, 25841 flow [2022-12-12 21:39:25,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 21:39:25,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:25,022 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, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:25,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:39:25,022 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:25,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:25,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1042961073, now seen corresponding path program 1 times [2022-12-12 21:39:25,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:25,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600410419] [2022-12-12 21:39:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:25,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:25,309 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 21:39:25,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:25,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600410419] [2022-12-12 21:39:25,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600410419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:25,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:25,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:39:25,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618087376] [2022-12-12 21:39:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:25,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:39:25,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:25,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:39:25,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:39:25,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 85 [2022-12-12 21:39:25,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 1021 transitions, 25841 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:39:25,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:25,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 85 [2022-12-12 21:39:25,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:32,308 INFO L130 PetriNetUnfolder]: 26147/40376 cut-off events. [2022-12-12 21:39:32,308 INFO L131 PetriNetUnfolder]: For 308502/312540 co-relation queries the response was YES. [2022-12-12 21:39:32,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471896 conditions, 40376 events. 26147/40376 cut-off events. For 308502/312540 co-relation queries the response was YES. Maximal size of possible extension queue 2006. Compared 302514 event pairs, 398 based on Foata normal form. 740/32622 useless extension candidates. Maximal degree in co-relation 471848. Up to 35792 conditions per place. [2022-12-12 21:39:32,546 INFO L137 encePairwiseOnDemand]: 79/85 looper letters, 734 selfloop transitions, 39 changer transitions 604/1400 dead transitions. [2022-12-12 21:39:32,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 1400 transitions, 38438 flow [2022-12-12 21:39:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:39:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:39:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-12-12 21:39:32,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3323529411764706 [2022-12-12 21:39:32,548 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 6 predicate places. [2022-12-12 21:39:32,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 1400 transitions, 38438 flow [2022-12-12 21:39:32,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 796 transitions, 21846 flow [2022-12-12 21:39:32,797 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 796 transitions, 21846 flow [2022-12-12 21:39:32,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:39:32,797 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:32,797 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, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:32,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:39:32,797 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1565161016, now seen corresponding path program 2 times [2022-12-12 21:39:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:32,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921878147] [2022-12-12 21:39:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:32,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:33,430 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 21:39:33,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:33,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921878147] [2022-12-12 21:39:33,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921878147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:33,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:33,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:39:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702900511] [2022-12-12 21:39:33,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:33,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:39:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:39:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:39:33,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 85 [2022-12-12 21:39:33,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 796 transitions, 21846 flow. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 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 21:39:33,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:33,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 85 [2022-12-12 21:39:33,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:37,539 INFO L130 PetriNetUnfolder]: 15937/24406 cut-off events. [2022-12-12 21:39:37,539 INFO L131 PetriNetUnfolder]: For 199081/200877 co-relation queries the response was YES. [2022-12-12 21:39:37,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307870 conditions, 24406 events. 15937/24406 cut-off events. For 199081/200877 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 164608 event pairs, 240 based on Foata normal form. 185/19264 useless extension candidates. Maximal degree in co-relation 307819. Up to 22631 conditions per place. [2022-12-12 21:39:37,752 INFO L137 encePairwiseOnDemand]: 77/85 looper letters, 775 selfloop transitions, 98 changer transitions 198/1108 dead transitions. [2022-12-12 21:39:37,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 1108 transitions, 32766 flow [2022-12-12 21:39:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:39:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:39:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2022-12-12 21:39:37,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3378151260504202 [2022-12-12 21:39:37,754 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 11 predicate places. [2022-12-12 21:39:37,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 1108 transitions, 32766 flow [2022-12-12 21:39:38,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 910 transitions, 26775 flow [2022-12-12 21:39:38,037 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 910 transitions, 26775 flow [2022-12-12 21:39:38,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 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 21:39:38,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:38,038 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, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:38,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 21:39:38,038 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:38,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:38,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1725786818, now seen corresponding path program 3 times [2022-12-12 21:39:38,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:38,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286361849] [2022-12-12 21:39:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:39:38,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:39:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:39:38,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:39:38,197 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:39:38,198 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 21:39:38,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 21:39:38,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 21:39:38,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 21:39:38,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 21:39:38,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 21:39:38,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 21:39:38,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 21:39:38,202 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:38,208 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:39:38,209 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:39:38,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:39:38 BasicIcfg [2022-12-12 21:39:38,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:39:38,330 INFO L158 Benchmark]: Toolchain (without parser) took 117891.21ms. Allocated memory was 181.4MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 137.6MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-12 21:39:38,330 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 157.9MB in the beginning and 157.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:39:38,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.52ms. Allocated memory is still 181.4MB. Free memory was 137.6MB in the beginning and 109.2MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-12 21:39:38,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.42ms. Allocated memory is still 181.4MB. Free memory was 109.2MB in the beginning and 106.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:39:38,331 INFO L158 Benchmark]: Boogie Preprocessor took 56.00ms. Allocated memory is still 181.4MB. Free memory was 106.7MB in the beginning and 104.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:39:38,331 INFO L158 Benchmark]: RCFGBuilder took 686.61ms. Allocated memory is still 181.4MB. Free memory was 104.6MB in the beginning and 66.3MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-12 21:39:38,335 INFO L158 Benchmark]: TraceAbstraction took 116473.53ms. Allocated memory was 181.4MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 65.3MB in the beginning and 5.4GB in the end (delta: -5.4GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-12 21:39:38,338 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.11ms. Allocated memory is still 181.4MB. Free memory was 157.9MB in the beginning and 157.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 585.52ms. Allocated memory is still 181.4MB. Free memory was 137.6MB in the beginning and 109.2MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.42ms. Allocated memory is still 181.4MB. Free memory was 109.2MB in the beginning and 106.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.00ms. Allocated memory is still 181.4MB. Free memory was 106.7MB in the beginning and 104.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 686.61ms. Allocated memory is still 181.4MB. Free memory was 104.6MB in the beginning and 66.3MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 116473.53ms. Allocated memory was 181.4MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 65.3MB in the beginning and 5.4GB in the end (delta: -5.4GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 140 PlacesBefore, 97 PlacesAfterwards, 129 TransitionsBefore, 85 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 53 ConcurrentYvCompositions, 3 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6776, independent: 6605, independent conditional: 6605, independent unconditional: 0, dependent: 171, dependent conditional: 171, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6776, independent: 6605, independent conditional: 0, independent unconditional: 6605, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6776, independent: 6605, independent conditional: 0, independent unconditional: 6605, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6776, independent: 6605, independent conditional: 0, independent unconditional: 6605, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3318, independent: 3255, independent conditional: 0, independent unconditional: 3255, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3318, independent: 3193, independent conditional: 0, independent unconditional: 3193, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 125, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 358, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6776, independent: 3350, independent conditional: 0, independent unconditional: 3350, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 3318, unknown conditional: 0, unknown unconditional: 3318] , Statistics on independence cache: Total cache size (in pairs): 6445, Positive cache size: 6382, Positive conditional cache size: 0, Positive unconditional cache size: 6382, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1129, ((void *)0), P0, ((void *)0))=-2, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1130, ((void *)0), P1, ((void *)0))=-1, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1131, ((void *)0), P2, ((void *)0))=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1132, ((void *)0), P3, ((void *)0))=1, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] - 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: 874]: 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: 876]: 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: 872]: 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: 878]: 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 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 3.8s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 116.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 99.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 872 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 872 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2735 IncrementalHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 41 mSDtfsCounter, 2735 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27049occurred in iteration=10, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 67589 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 1814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 21:39:38,364 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...