/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:38:26,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:38:26,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:38:26,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:38:26,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:38:26,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:38:26,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:38:26,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:38:26,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:38:26,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:38:26,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:38:26,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:38:26,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:38:26,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:38:26,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:38:26,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:38:26,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:38:26,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:38:26,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:38:26,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:38:26,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:38:26,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:38:26,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:38:26,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:38:26,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:38:26,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:38:26,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:38:26,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:38:26,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:38:26,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:38:26,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:38:26,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:38:26,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:38:26,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:38:26,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:38:26,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:38:26,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:38:26,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:38:26,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:38:26,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:38:26,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:38:26,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 14:38:26,958 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:38:26,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:38:26,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:38:26,960 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:38:26,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:38:26,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:38:26,961 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:38:26,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:38:26,961 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:38:26,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:38:26,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:38:26,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:38:26,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:38:26,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:38:26,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:38:26,962 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:38:26,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:38:26,962 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:38:26,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:38:26,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:38:26,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:38:26,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:38:26,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:38:26,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:38:26,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:38:26,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:38:26,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:38:26,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:38:26,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:38:26,964 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:38:26,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-12 14:38:27,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:38:27,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:38:27,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:38:27,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:38:27,227 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:38:27,228 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 14:38:28,220 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:38:28,455 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:38:28,455 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 14:38:28,467 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3b43a31/652c3e7b2c2641b1823778039336989c/FLAG5a1aa479e [2022-12-12 14:38:28,480 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3b43a31/652c3e7b2c2641b1823778039336989c [2022-12-12 14:38:28,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:38:28,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:38:28,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:38:28,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:38:28,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:38:28,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:28,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a1ab9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28, skipping insertion in model container [2022-12-12 14:38:28,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:28,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:38:28,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:38:28,656 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-12 14:38:28,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:38:28,865 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:38:28,875 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-12 14:38:28,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:38:28,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:38:28,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:38:28,965 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:38:28,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28 WrapperNode [2022-12-12 14:38:28,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:38:28,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:38:28,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:38:28,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:38:28,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:29,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:29,030 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-12 14:38:29,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:38:29,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:38:29,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:38:29,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:38:29,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:29,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:29,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:29,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:29,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:29,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:29,062 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:29,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:29,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:38:29,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:38:29,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:38:29,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:38:29,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (1/1) ... [2022-12-12 14:38:29,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:38:29,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:38:29,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 14:38:29,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 14:38:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:38:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:38:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:38:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:38:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:38:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:38:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:38:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:38:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:38:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:38:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:38:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:38:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:38:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:38:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:38:29,151 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:38:29,313 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:38:29,314 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:38:29,554 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:38:29,626 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:38:29,627 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:38:29,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:38:29 BoogieIcfgContainer [2022-12-12 14:38:29,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:38:29,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:38:29,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:38:29,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:38:29,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:38:28" (1/3) ... [2022-12-12 14:38:29,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9e1126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:38:29, skipping insertion in model container [2022-12-12 14:38:29,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:38:28" (2/3) ... [2022-12-12 14:38:29,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9e1126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:38:29, skipping insertion in model container [2022-12-12 14:38:29,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:38:29" (3/3) ... [2022-12-12 14:38:29,636 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 14:38:29,653 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:38:29,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:38:29,654 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:38:29,708 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:38:29,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 14:38:29,804 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 14:38:29,805 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:38:29,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 14:38:29,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 14:38:29,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-12 14:38:29,816 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:38:29,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 14:38:29,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-12 14:38:29,877 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 14:38:29,877 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:38:29,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 14:38:29,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 14:38:29,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-12 14:38:36,970 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-12 14:38:36,985 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:38:36,990 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;@22b053a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:38:36,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 14:38:36,997 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-12 14:38:36,997 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:38:36,997 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:36,998 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:36,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:37,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1323519518, now seen corresponding path program 1 times [2022-12-12 14:38:37,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:37,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531918705] [2022-12-12 14:38:37,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:37,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:37,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531918705] [2022-12-12 14:38:37,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531918705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:37,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:37,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:38:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723973338] [2022-12-12 14:38:37,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:37,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:38:37,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:37,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:38:37,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:38:37,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 56 [2022-12-12 14:38:37,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:37,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:37,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 56 [2022-12-12 14:38:37,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:38,415 INFO L130 PetriNetUnfolder]: 6079/9809 cut-off events. [2022-12-12 14:38:38,415 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-12 14:38:38,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18592 conditions, 9809 events. 6079/9809 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 73377 event pairs, 855 based on Foata normal form. 0/5894 useless extension candidates. Maximal degree in co-relation 18581. Up to 7305 conditions per place. [2022-12-12 14:38:38,450 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 28 selfloop transitions, 2 changer transitions 44/84 dead transitions. [2022-12-12 14:38:38,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 325 flow [2022-12-12 14:38:38,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:38:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:38:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-12-12 14:38:38,460 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-12 14:38:38,461 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 121 flow. Second operand 3 states and 111 transitions. [2022-12-12 14:38:38,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 325 flow [2022-12-12 14:38:38,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:38:38,467 INFO L231 Difference]: Finished difference. Result has 61 places, 30 transitions, 70 flow [2022-12-12 14:38:38,469 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=61, PETRI_TRANSITIONS=30} [2022-12-12 14:38:38,472 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2022-12-12 14:38:38,472 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 30 transitions, 70 flow [2022-12-12 14:38:38,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:38,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:38,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:38,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:38:38,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash 592008445, now seen corresponding path program 1 times [2022-12-12 14:38:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:38,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818479283] [2022-12-12 14:38:38,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:38,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:38,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818479283] [2022-12-12 14:38:38,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818479283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:38,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:38,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:38:38,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72850535] [2022-12-12 14:38:38,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:38,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:38:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:38:38,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:38:38,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 14:38:38,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:38,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:38,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 14:38:38,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:38,825 INFO L130 PetriNetUnfolder]: 1136/1857 cut-off events. [2022-12-12 14:38:38,825 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-12 14:38:38,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 1857 events. 1136/1857 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9564 event pairs, 559 based on Foata normal form. 10/1544 useless extension candidates. Maximal degree in co-relation 3698. Up to 1615 conditions per place. [2022-12-12 14:38:38,834 INFO L137 encePairwiseOnDemand]: 52/56 looper letters, 31 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-12 14:38:38,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 170 flow [2022-12-12 14:38:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:38:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:38:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-12 14:38:38,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2022-12-12 14:38:38,838 INFO L175 Difference]: Start difference. First operand has 61 places, 30 transitions, 70 flow. Second operand 3 states and 62 transitions. [2022-12-12 14:38:38,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 170 flow [2022-12-12 14:38:38,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:38,839 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 85 flow [2022-12-12 14:38:38,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-12 14:38:38,840 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -25 predicate places. [2022-12-12 14:38:38,840 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 85 flow [2022-12-12 14:38:38,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:38,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:38,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:38,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:38:38,842 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:38,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1172391830, now seen corresponding path program 1 times [2022-12-12 14:38:38,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:38,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886193742] [2022-12-12 14:38:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:38,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:39,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:39,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886193742] [2022-12-12 14:38:39,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886193742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:39,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:39,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:38:39,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219104845] [2022-12-12 14:38:39,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:39,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:38:39,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:39,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:38:39,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:38:39,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 14:38:39,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:39,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:39,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 14:38:39,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:39,330 INFO L130 PetriNetUnfolder]: 1257/2054 cut-off events. [2022-12-12 14:38:39,330 INFO L131 PetriNetUnfolder]: For 137/138 co-relation queries the response was YES. [2022-12-12 14:38:39,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 2054 events. 1257/2054 cut-off events. For 137/138 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10545 event pairs, 523 based on Foata normal form. 8/1704 useless extension candidates. Maximal degree in co-relation 4274. Up to 1760 conditions per place. [2022-12-12 14:38:39,340 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 34 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2022-12-12 14:38:39,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 213 flow [2022-12-12 14:38:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:38:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:38:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-12 14:38:39,343 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2022-12-12 14:38:39,343 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 85 flow. Second operand 4 states and 74 transitions. [2022-12-12 14:38:39,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 213 flow [2022-12-12 14:38:39,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:38:39,344 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 119 flow [2022-12-12 14:38:39,344 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-12 14:38:39,345 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -21 predicate places. [2022-12-12 14:38:39,345 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 119 flow [2022-12-12 14:38:39,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:39,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:39,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:39,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:38:39,345 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:39,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:39,346 INFO L85 PathProgramCache]: Analyzing trace with hash 35430440, now seen corresponding path program 1 times [2022-12-12 14:38:39,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:39,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389333758] [2022-12-12 14:38:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:39,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:39,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:39,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389333758] [2022-12-12 14:38:39,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389333758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:39,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:39,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:38:39,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079547846] [2022-12-12 14:38:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:39,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:38:39,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:39,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:38:39,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:38:39,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 14:38:39,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:39,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:39,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 14:38:39,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:39,884 INFO L130 PetriNetUnfolder]: 1214/1996 cut-off events. [2022-12-12 14:38:39,884 INFO L131 PetriNetUnfolder]: For 592/593 co-relation queries the response was YES. [2022-12-12 14:38:39,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4631 conditions, 1996 events. 1214/1996 cut-off events. For 592/593 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10293 event pairs, 327 based on Foata normal form. 25/1671 useless extension candidates. Maximal degree in co-relation 4617. Up to 1458 conditions per place. [2022-12-12 14:38:39,895 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 37 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2022-12-12 14:38:39,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 261 flow [2022-12-12 14:38:39,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:38:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:38:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-12 14:38:39,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2022-12-12 14:38:39,896 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 119 flow. Second operand 4 states and 78 transitions. [2022-12-12 14:38:39,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 261 flow [2022-12-12 14:38:39,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 261 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-12 14:38:39,903 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 168 flow [2022-12-12 14:38:39,904 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-12 14:38:39,905 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -16 predicate places. [2022-12-12 14:38:39,905 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 168 flow [2022-12-12 14:38:39,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:39,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:39,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:39,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:38:39,905 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash 35484256, now seen corresponding path program 1 times [2022-12-12 14:38:39,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:39,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789379572] [2022-12-12 14:38:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:39,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:40,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:40,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789379572] [2022-12-12 14:38:40,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789379572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:40,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:40,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:38:40,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105729913] [2022-12-12 14:38:40,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:40,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:38:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:40,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:38:40,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:38:40,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 14:38:40,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:40,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:40,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 14:38:40,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:40,636 INFO L130 PetriNetUnfolder]: 1264/2088 cut-off events. [2022-12-12 14:38:40,636 INFO L131 PetriNetUnfolder]: For 1384/1385 co-relation queries the response was YES. [2022-12-12 14:38:40,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5570 conditions, 2088 events. 1264/2088 cut-off events. For 1384/1385 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10977 event pairs, 363 based on Foata normal form. 13/1746 useless extension candidates. Maximal degree in co-relation 5552. Up to 1614 conditions per place. [2022-12-12 14:38:40,650 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 47 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2022-12-12 14:38:40,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 383 flow [2022-12-12 14:38:40,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:38:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:38:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-12 14:38:40,652 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3464285714285714 [2022-12-12 14:38:40,652 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 168 flow. Second operand 5 states and 97 transitions. [2022-12-12 14:38:40,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 383 flow [2022-12-12 14:38:40,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 368 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:40,662 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 230 flow [2022-12-12 14:38:40,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-12 14:38:40,665 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -12 predicate places. [2022-12-12 14:38:40,665 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 230 flow [2022-12-12 14:38:40,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:40,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:40,665 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:40,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:38:40,665 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:40,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash 35329876, now seen corresponding path program 2 times [2022-12-12 14:38:40,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:40,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923033011] [2022-12-12 14:38:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:41,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:41,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923033011] [2022-12-12 14:38:41,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923033011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:41,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:41,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:38:41,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61032272] [2022-12-12 14:38:41,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:41,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:38:41,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:41,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:38:41,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:38:41,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 14:38:41,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:41,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:41,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 14:38:41,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:41,250 INFO L130 PetriNetUnfolder]: 1242/2058 cut-off events. [2022-12-12 14:38:41,250 INFO L131 PetriNetUnfolder]: For 2382/2383 co-relation queries the response was YES. [2022-12-12 14:38:41,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 2058 events. 1242/2058 cut-off events. For 2382/2383 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10791 event pairs, 374 based on Foata normal form. 8/1713 useless extension candidates. Maximal degree in co-relation 6054. Up to 1662 conditions per place. [2022-12-12 14:38:41,266 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 43 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2022-12-12 14:38:41,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 389 flow [2022-12-12 14:38:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:38:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:38:41,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-12 14:38:41,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2022-12-12 14:38:41,268 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 230 flow. Second operand 4 states and 76 transitions. [2022-12-12 14:38:41,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 389 flow [2022-12-12 14:38:41,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 379 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-12 14:38:41,272 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 270 flow [2022-12-12 14:38:41,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2022-12-12 14:38:41,273 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -9 predicate places. [2022-12-12 14:38:41,273 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 270 flow [2022-12-12 14:38:41,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:41,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:41,273 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:41,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:38:41,273 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1098496774, now seen corresponding path program 1 times [2022-12-12 14:38:41,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:41,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013256121] [2022-12-12 14:38:41,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:41,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:41,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:41,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013256121] [2022-12-12 14:38:41,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013256121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:41,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:41,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:38:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126190534] [2022-12-12 14:38:41,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:41,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:38:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:38:41,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:38:41,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 14:38:41,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:41,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:41,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 14:38:41,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:42,012 INFO L130 PetriNetUnfolder]: 1342/2268 cut-off events. [2022-12-12 14:38:42,013 INFO L131 PetriNetUnfolder]: For 4061/4062 co-relation queries the response was YES. [2022-12-12 14:38:42,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6981 conditions, 2268 events. 1342/2268 cut-off events. For 4061/4062 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12728 event pairs, 232 based on Foata normal form. 40/1923 useless extension candidates. Maximal degree in co-relation 6959. Up to 1343 conditions per place. [2022-12-12 14:38:42,028 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 55 selfloop transitions, 23 changer transitions 0/88 dead transitions. [2022-12-12 14:38:42,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 564 flow [2022-12-12 14:38:42,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:38:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:38:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-12 14:38:42,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35119047619047616 [2022-12-12 14:38:42,030 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 270 flow. Second operand 6 states and 118 transitions. [2022-12-12 14:38:42,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 564 flow [2022-12-12 14:38:42,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 546 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:42,035 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 382 flow [2022-12-12 14:38:42,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2022-12-12 14:38:42,035 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2022-12-12 14:38:42,036 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 382 flow [2022-12-12 14:38:42,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:42,036 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:42,036 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:42,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:38:42,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash -306238095, now seen corresponding path program 1 times [2022-12-12 14:38:42,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:42,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061755669] [2022-12-12 14:38:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:42,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:42,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061755669] [2022-12-12 14:38:42,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061755669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:42,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:42,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:38:42,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073135569] [2022-12-12 14:38:42,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:42,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:38:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:42,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:38:42,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:38:42,680 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 14:38:42,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 382 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:42,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:42,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 14:38:42,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:43,073 INFO L130 PetriNetUnfolder]: 2125/3306 cut-off events. [2022-12-12 14:38:43,073 INFO L131 PetriNetUnfolder]: For 8304/8304 co-relation queries the response was YES. [2022-12-12 14:38:43,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11275 conditions, 3306 events. 2125/3306 cut-off events. For 8304/8304 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 17005 event pairs, 290 based on Foata normal form. 30/2818 useless extension candidates. Maximal degree in co-relation 11251. Up to 2347 conditions per place. [2022-12-12 14:38:43,098 INFO L137 encePairwiseOnDemand]: 47/56 looper letters, 80 selfloop transitions, 20 changer transitions 0/107 dead transitions. [2022-12-12 14:38:43,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 803 flow [2022-12-12 14:38:43,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:38:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:38:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2022-12-12 14:38:43,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3112244897959184 [2022-12-12 14:38:43,100 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 382 flow. Second operand 7 states and 122 transitions. [2022-12-12 14:38:43,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 803 flow [2022-12-12 14:38:43,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 107 transitions, 767 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:43,112 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 489 flow [2022-12-12 14:38:43,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2022-12-12 14:38:43,114 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 2 predicate places. [2022-12-12 14:38:43,114 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 489 flow [2022-12-12 14:38:43,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:43,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:43,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:43,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:38:43,115 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:43,115 INFO L85 PathProgramCache]: Analyzing trace with hash 866111213, now seen corresponding path program 2 times [2022-12-12 14:38:43,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:43,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732841838] [2022-12-12 14:38:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:43,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:43,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732841838] [2022-12-12 14:38:43,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732841838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:43,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:43,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:38:43,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809508144] [2022-12-12 14:38:43,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:43,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:38:43,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:43,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:38:43,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:38:43,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 14:38:43,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 489 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:43,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:43,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 14:38:43,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:43,891 INFO L130 PetriNetUnfolder]: 1576/2657 cut-off events. [2022-12-12 14:38:43,891 INFO L131 PetriNetUnfolder]: For 9126/9167 co-relation queries the response was YES. [2022-12-12 14:38:43,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9869 conditions, 2657 events. 1576/2657 cut-off events. For 9126/9167 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 15405 event pairs, 154 based on Foata normal form. 25/2237 useless extension candidates. Maximal degree in co-relation 9842. Up to 1754 conditions per place. [2022-12-12 14:38:43,907 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 61 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2022-12-12 14:38:43,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 718 flow [2022-12-12 14:38:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:38:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:38:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-12 14:38:43,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3357142857142857 [2022-12-12 14:38:43,911 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 489 flow. Second operand 5 states and 94 transitions. [2022-12-12 14:38:43,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 718 flow [2022-12-12 14:38:43,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 690 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:43,920 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 537 flow [2022-12-12 14:38:43,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=537, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2022-12-12 14:38:43,921 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 5 predicate places. [2022-12-12 14:38:43,921 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 537 flow [2022-12-12 14:38:43,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:43,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:43,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:43,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:38:43,922 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash -256189215, now seen corresponding path program 3 times [2022-12-12 14:38:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:43,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106294695] [2022-12-12 14:38:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:44,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:44,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106294695] [2022-12-12 14:38:44,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106294695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:44,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:44,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:38:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369969070] [2022-12-12 14:38:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:44,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:38:44,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:44,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:38:44,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:38:44,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 14:38:44,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 537 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:44,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:44,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 14:38:44,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:44,681 INFO L130 PetriNetUnfolder]: 1866/3222 cut-off events. [2022-12-12 14:38:44,681 INFO L131 PetriNetUnfolder]: For 13770/13811 co-relation queries the response was YES. [2022-12-12 14:38:44,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11649 conditions, 3222 events. 1866/3222 cut-off events. For 13770/13811 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 19730 event pairs, 267 based on Foata normal form. 100/2705 useless extension candidates. Maximal degree in co-relation 11620. Up to 1303 conditions per place. [2022-12-12 14:38:44,701 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 56 selfloop transitions, 21 changer transitions 0/88 dead transitions. [2022-12-12 14:38:44,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 88 transitions, 763 flow [2022-12-12 14:38:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:38:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:38:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-12 14:38:44,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31785714285714284 [2022-12-12 14:38:44,702 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 537 flow. Second operand 5 states and 89 transitions. [2022-12-12 14:38:44,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 88 transitions, 763 flow [2022-12-12 14:38:44,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 727 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:44,716 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 565 flow [2022-12-12 14:38:44,716 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=565, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2022-12-12 14:38:44,717 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 8 predicate places. [2022-12-12 14:38:44,717 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 565 flow [2022-12-12 14:38:44,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:44,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:44,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:44,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:38:44,717 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:44,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash -259455809, now seen corresponding path program 1 times [2022-12-12 14:38:44,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:44,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984915981] [2022-12-12 14:38:44,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:44,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:44,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:44,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984915981] [2022-12-12 14:38:44,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984915981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:44,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:44,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:38:44,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977268688] [2022-12-12 14:38:44,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:44,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:38:44,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:44,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:38:44,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:38:44,875 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 14:38:44,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:44,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:44,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 14:38:44,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:45,225 INFO L130 PetriNetUnfolder]: 2611/4240 cut-off events. [2022-12-12 14:38:45,226 INFO L131 PetriNetUnfolder]: For 18967/19025 co-relation queries the response was YES. [2022-12-12 14:38:45,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16092 conditions, 4240 events. 2611/4240 cut-off events. For 18967/19025 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 25774 event pairs, 822 based on Foata normal form. 85/2909 useless extension candidates. Maximal degree in co-relation 16062. Up to 3979 conditions per place. [2022-12-12 14:38:45,251 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 77 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2022-12-12 14:38:45,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 101 transitions, 971 flow [2022-12-12 14:38:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:38:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:38:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-12 14:38:45,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-12 14:38:45,253 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 565 flow. Second operand 3 states and 63 transitions. [2022-12-12 14:38:45,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 101 transitions, 971 flow [2022-12-12 14:38:45,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 101 transitions, 911 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-12 14:38:45,270 INFO L231 Difference]: Finished difference. Result has 72 places, 78 transitions, 589 flow [2022-12-12 14:38:45,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=589, PETRI_PLACES=72, PETRI_TRANSITIONS=78} [2022-12-12 14:38:45,271 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 7 predicate places. [2022-12-12 14:38:45,271 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 78 transitions, 589 flow [2022-12-12 14:38:45,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:45,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:45,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:45,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:38:45,271 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:45,272 INFO L85 PathProgramCache]: Analyzing trace with hash 839139988, now seen corresponding path program 1 times [2022-12-12 14:38:45,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:45,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630199041] [2022-12-12 14:38:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:45,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:45,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630199041] [2022-12-12 14:38:45,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630199041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:45,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:45,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:38:45,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376954480] [2022-12-12 14:38:45,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:45,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:38:45,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:45,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:38:45,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:38:45,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 14:38:45,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 78 transitions, 589 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:45,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:45,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 14:38:45,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:45,643 INFO L130 PetriNetUnfolder]: 1294/2422 cut-off events. [2022-12-12 14:38:45,643 INFO L131 PetriNetUnfolder]: For 7539/7564 co-relation queries the response was YES. [2022-12-12 14:38:45,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10483 conditions, 2422 events. 1294/2422 cut-off events. For 7539/7564 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 15705 event pairs, 177 based on Foata normal form. 166/1796 useless extension candidates. Maximal degree in co-relation 10453. Up to 1819 conditions per place. [2022-12-12 14:38:45,658 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 74 selfloop transitions, 19 changer transitions 0/104 dead transitions. [2022-12-12 14:38:45,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 104 transitions, 925 flow [2022-12-12 14:38:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:38:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:38:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-12 14:38:45,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2022-12-12 14:38:45,660 INFO L175 Difference]: Start difference. First operand has 72 places, 78 transitions, 589 flow. Second operand 4 states and 86 transitions. [2022-12-12 14:38:45,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 104 transitions, 925 flow [2022-12-12 14:38:45,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 104 transitions, 860 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-12 14:38:45,674 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 505 flow [2022-12-12 14:38:45,674 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=505, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2022-12-12 14:38:45,674 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 5 predicate places. [2022-12-12 14:38:45,674 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 505 flow [2022-12-12 14:38:45,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:45,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:45,675 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:45,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:38:45,675 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash -628126418, now seen corresponding path program 1 times [2022-12-12 14:38:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:45,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857766900] [2022-12-12 14:38:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:45,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:45,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:45,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857766900] [2022-12-12 14:38:45,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857766900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:45,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:45,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:38:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416358572] [2022-12-12 14:38:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:45,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:38:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:45,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:38:45,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:38:45,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 14:38:45,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 505 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:45,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:45,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 14:38:45,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:46,519 INFO L130 PetriNetUnfolder]: 3078/5614 cut-off events. [2022-12-12 14:38:46,520 INFO L131 PetriNetUnfolder]: For 13861/14493 co-relation queries the response was YES. [2022-12-12 14:38:46,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24935 conditions, 5614 events. 3078/5614 cut-off events. For 13861/14493 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 41716 event pairs, 320 based on Foata normal form. 389/4983 useless extension candidates. Maximal degree in co-relation 24906. Up to 3375 conditions per place. [2022-12-12 14:38:46,546 INFO L137 encePairwiseOnDemand]: 46/56 looper letters, 96 selfloop transitions, 19 changer transitions 69/196 dead transitions. [2022-12-12 14:38:46,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 196 transitions, 1794 flow [2022-12-12 14:38:46,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:38:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:38:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-12-12 14:38:46,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-12 14:38:46,548 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 505 flow. Second operand 6 states and 119 transitions. [2022-12-12 14:38:46,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 196 transitions, 1794 flow [2022-12-12 14:38:46,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 196 transitions, 1692 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-12-12 14:38:46,563 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 670 flow [2022-12-12 14:38:46,563 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=670, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2022-12-12 14:38:46,563 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 11 predicate places. [2022-12-12 14:38:46,564 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 670 flow [2022-12-12 14:38:46,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:46,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:46,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:46,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 14:38:46,564 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1222548784, now seen corresponding path program 2 times [2022-12-12 14:38:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:46,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126409343] [2022-12-12 14:38:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:46,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:46,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126409343] [2022-12-12 14:38:46,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126409343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:46,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:46,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:38:46,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666859437] [2022-12-12 14:38:46,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:46,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:38:46,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:46,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:38:46,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:38:46,796 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 14:38:46,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 670 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:46,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:46,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 14:38:46,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:47,208 INFO L130 PetriNetUnfolder]: 2434/4629 cut-off events. [2022-12-12 14:38:47,209 INFO L131 PetriNetUnfolder]: For 17425/17668 co-relation queries the response was YES. [2022-12-12 14:38:47,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20873 conditions, 4629 events. 2434/4629 cut-off events. For 17425/17668 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 35121 event pairs, 531 based on Foata normal form. 252/3959 useless extension candidates. Maximal degree in co-relation 20841. Up to 2768 conditions per place. [2022-12-12 14:38:47,229 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 63 selfloop transitions, 7 changer transitions 30/112 dead transitions. [2022-12-12 14:38:47,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 112 transitions, 1069 flow [2022-12-12 14:38:47,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:38:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:38:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-12 14:38:47,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3169642857142857 [2022-12-12 14:38:47,230 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 670 flow. Second operand 4 states and 71 transitions. [2022-12-12 14:38:47,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 112 transitions, 1069 flow [2022-12-12 14:38:47,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 112 transitions, 1046 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-12 14:38:47,251 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 524 flow [2022-12-12 14:38:47,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2022-12-12 14:38:47,252 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 10 predicate places. [2022-12-12 14:38:47,252 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 524 flow [2022-12-12 14:38:47,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:47,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:47,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:47,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 14:38:47,253 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:47,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:47,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1402176164, now seen corresponding path program 1 times [2022-12-12 14:38:47,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:47,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867101738] [2022-12-12 14:38:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:47,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:38:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:38:47,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:38:47,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867101738] [2022-12-12 14:38:47,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867101738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:38:47,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:38:47,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:38:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219268049] [2022-12-12 14:38:47,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:38:47,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:38:47,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:38:47,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:38:47,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:38:47,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 14:38:47,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 524 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:47,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:38:47,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 14:38:47,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:38:47,581 INFO L130 PetriNetUnfolder]: 903/1933 cut-off events. [2022-12-12 14:38:47,582 INFO L131 PetriNetUnfolder]: For 4755/4762 co-relation queries the response was YES. [2022-12-12 14:38:47,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8105 conditions, 1933 events. 903/1933 cut-off events. For 4755/4762 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14081 event pairs, 26 based on Foata normal form. 295/1375 useless extension candidates. Maximal degree in co-relation 8072. Up to 1153 conditions per place. [2022-12-12 14:38:47,587 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 22 selfloop transitions, 28 changer transitions 36/90 dead transitions. [2022-12-12 14:38:47,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 90 transitions, 880 flow [2022-12-12 14:38:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:38:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:38:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-12 14:38:47,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-12 14:38:47,588 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 524 flow. Second operand 5 states and 90 transitions. [2022-12-12 14:38:47,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 90 transitions, 880 flow [2022-12-12 14:38:47,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 784 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-12-12 14:38:47,598 INFO L231 Difference]: Finished difference. Result has 74 places, 47 transitions, 350 flow [2022-12-12 14:38:47,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=74, PETRI_TRANSITIONS=47} [2022-12-12 14:38:47,599 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 9 predicate places. [2022-12-12 14:38:47,599 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 47 transitions, 350 flow [2022-12-12 14:38:47,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:38:47,599 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:38:47,599 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 14:38:47,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 14:38:47,599 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:38:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:38:47,600 INFO L85 PathProgramCache]: Analyzing trace with hash 906374420, now seen corresponding path program 1 times [2022-12-12 14:38:47,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:38:47,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828632632] [2022-12-12 14:38:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:38:47,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:38:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:38:47,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:38:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:38:47,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:38:47,679 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:38:47,680 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 14:38:47,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 14:38:47,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 14:38:47,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 14:38:47,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 14:38:47,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 14:38:47,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 14:38:47,686 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:38:47,690 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:38:47,690 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:38:47,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:38:47 BasicIcfg [2022-12-12 14:38:47,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:38:47,745 INFO L158 Benchmark]: Toolchain (without parser) took 19261.93ms. Allocated memory was 195.0MB in the beginning and 706.7MB in the end (delta: 511.7MB). Free memory was 169.4MB in the beginning and 590.1MB in the end (delta: -420.7MB). Peak memory consumption was 91.5MB. Max. memory is 8.0GB. [2022-12-12 14:38:47,745 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 195.0MB. Free memory is still 171.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:38:47,745 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.08ms. Allocated memory is still 195.0MB. Free memory was 169.4MB in the beginning and 143.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 14:38:47,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.53ms. Allocated memory is still 195.0MB. Free memory was 143.2MB in the beginning and 140.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:38:47,746 INFO L158 Benchmark]: Boogie Preprocessor took 32.77ms. Allocated memory is still 195.0MB. Free memory was 140.6MB in the beginning and 139.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:38:47,746 INFO L158 Benchmark]: RCFGBuilder took 563.20ms. Allocated memory is still 195.0MB. Free memory was 139.0MB in the beginning and 155.0MB in the end (delta: -16.0MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. [2022-12-12 14:38:47,746 INFO L158 Benchmark]: TraceAbstraction took 18113.65ms. Allocated memory was 195.0MB in the beginning and 706.7MB in the end (delta: 511.7MB). Free memory was 154.0MB in the beginning and 590.1MB in the end (delta: -436.1MB). Peak memory consumption was 75.6MB. Max. memory is 8.0GB. [2022-12-12 14:38:47,747 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.14ms. Allocated memory is still 195.0MB. Free memory is still 171.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 482.08ms. Allocated memory is still 195.0MB. Free memory was 169.4MB in the beginning and 143.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.53ms. Allocated memory is still 195.0MB. Free memory was 143.2MB in the beginning and 140.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.77ms. Allocated memory is still 195.0MB. Free memory was 140.6MB in the beginning and 139.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 563.20ms. Allocated memory is still 195.0MB. Free memory was 139.0MB in the beginning and 155.0MB in the end (delta: -16.0MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. * TraceAbstraction took 18113.65ms. Allocated memory was 195.0MB in the beginning and 706.7MB in the end (delta: 511.7MB). Free memory was 154.0MB in the beginning and 590.1MB in the end (delta: -436.1MB). Peak memory consumption was 75.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 111 PlacesBefore, 65 PlacesAfterwards, 103 TransitionsBefore, 56 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 3061, independent unconditional: 0, dependent: 117, dependent conditional: 117, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1713, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1713, independent: 1622, independent conditional: 0, independent unconditional: 1622, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 295, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3178, independent: 1393, independent conditional: 0, independent unconditional: 1393, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 1713, unknown conditional: 0, unknown unconditional: 1713] , Statistics on independence cache: Total cache size (in pairs): 3019, Positive cache size: 2974, Positive conditional cache size: 0, Positive unconditional cache size: 2974, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-3, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-2, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 814]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 396 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 396 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1267 IncrementalHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 28 mSDtfsCounter, 1267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=670occurred in iteration=13, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 2158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 14:38:47,775 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...