/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 18:39:41,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 18:39:41,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 18:39:41,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 18:39:41,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 18:39:41,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 18:39:41,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 18:39:41,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 18:39:41,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 18:39:41,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 18:39:41,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 18:39:41,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 18:39:41,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 18:39:41,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 18:39:41,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 18:39:41,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 18:39:41,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 18:39:41,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 18:39:41,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 18:39:41,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 18:39:41,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 18:39:41,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 18:39:41,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 18:39:41,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 18:39:41,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 18:39:41,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 18:39:41,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 18:39:41,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 18:39:41,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 18:39:41,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 18:39:41,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 18:39:41,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 18:39:41,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 18:39:41,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 18:39:41,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 18:39:41,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 18:39:41,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 18:39:41,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 18:39:41,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 18:39:41,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 18:39:41,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 18:39:41,812 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-NoLbe.epf [2022-12-05 18:39:41,844 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 18:39:41,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 18:39:41,846 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 18:39:41,846 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 18:39:41,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 18:39:41,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 18:39:41,847 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 18:39:41,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 18:39:41,848 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 18:39:41,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 18:39:41,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 18:39:41,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 18:39:41,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 18:39:41,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 18:39:41,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 18:39:41,850 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 18:39:41,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 18:39:41,850 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 18:39:41,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 18:39:41,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 18:39:41,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 18:39:41,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 18:39:41,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 18:39:41,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:39:41,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 18:39:41,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 18:39:41,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 18:39:41,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 18:39:41,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 18:39:41,852 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 18:39:41,852 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 18:39:41,852 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-05 18:39:42,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 18:39:42,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 18:39:42,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 18:39:42,182 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 18:39:42,182 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 18:39:42,184 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-12-05 18:39:43,390 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 18:39:43,678 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 18:39:43,678 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-12-05 18:39:43,699 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecee759f7/15cd4c9af1c243159846c211169b2c76/FLAG7cc5b450a [2022-12-05 18:39:43,714 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecee759f7/15cd4c9af1c243159846c211169b2c76 [2022-12-05 18:39:43,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 18:39:43,717 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 18:39:43,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 18:39:43,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 18:39:43,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 18:39:43,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:39:43" (1/1) ... [2022-12-05 18:39:43,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422c8e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:43, skipping insertion in model container [2022-12-05 18:39:43,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:39:43" (1/1) ... [2022-12-05 18:39:43,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 18:39:43,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 18:39:43,902 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 18:39:44,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:39:44,156 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 18:39:44,172 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 18:39:44,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:44,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:44,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:39:44,264 INFO L208 MainTranslator]: Completed translation [2022-12-05 18:39:44,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44 WrapperNode [2022-12-05 18:39:44,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 18:39:44,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 18:39:44,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 18:39:44,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 18:39:44,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (1/1) ... [2022-12-05 18:39:44,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (1/1) ... [2022-12-05 18:39:44,335 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-05 18:39:44,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 18:39:44,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 18:39:44,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 18:39:44,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 18:39:44,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (1/1) ... [2022-12-05 18:39:44,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (1/1) ... [2022-12-05 18:39:44,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (1/1) ... [2022-12-05 18:39:44,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (1/1) ... [2022-12-05 18:39:44,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (1/1) ... [2022-12-05 18:39:44,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (1/1) ... [2022-12-05 18:39:44,385 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (1/1) ... [2022-12-05 18:39:44,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (1/1) ... [2022-12-05 18:39:44,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 18:39:44,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 18:39:44,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 18:39:44,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 18:39:44,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (1/1) ... [2022-12-05 18:39:44,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:39:44,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 18:39:44,418 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-05 18:39:44,444 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-05 18:39:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 18:39:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 18:39:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 18:39:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 18:39:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 18:39:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 18:39:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 18:39:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 18:39:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 18:39:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 18:39:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 18:39:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 18:39:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 18:39:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 18:39:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 18:39:44,463 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 18:39:44,618 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 18:39:44,620 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 18:39:44,900 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 18:39:45,152 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 18:39:45,153 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 18:39:45,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:39:45 BoogieIcfgContainer [2022-12-05 18:39:45,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 18:39:45,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 18:39:45,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 18:39:45,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 18:39:45,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 06:39:43" (1/3) ... [2022-12-05 18:39:45,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebc281e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:39:45, skipping insertion in model container [2022-12-05 18:39:45,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:44" (2/3) ... [2022-12-05 18:39:45,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebc281e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:39:45, skipping insertion in model container [2022-12-05 18:39:45,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:39:45" (3/3) ... [2022-12-05 18:39:45,164 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2022-12-05 18:39:45,181 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 18:39:45,181 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 18:39:45,181 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 18:39:45,251 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 18:39:45,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 18:39:45,395 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 18:39:45,395 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:39:45,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 18:39:45,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 18:39:45,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-05 18:39:45,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 18:39:45,425 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;@3565491a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 18:39:45,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 18:39:45,446 INFO L130 PetriNetUnfolder]: 0/56 cut-off events. [2022-12-05 18:39:45,446 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:39:45,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:45,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:45,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:45,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2017931865, now seen corresponding path program 1 times [2022-12-05 18:39:45,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:45,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898484396] [2022-12-05 18:39:45,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:45,962 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-05 18:39:45,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:45,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898484396] [2022-12-05 18:39:45,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898484396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:45,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:45,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 18:39:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944561293] [2022-12-05 18:39:45,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:45,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 18:39:45,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:46,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 18:39:46,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 18:39:46,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2022-12-05 18:39:46,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-05 18:39:46,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:46,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2022-12-05 18:39:46,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:46,189 INFO L130 PetriNetUnfolder]: 57/307 cut-off events. [2022-12-05 18:39:46,189 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-05 18:39:46,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 307 events. 57/307 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1298 event pairs, 11 based on Foata normal form. 15/305 useless extension candidates. Maximal degree in co-relation 384. Up to 75 conditions per place. [2022-12-05 18:39:46,195 INFO L137 encePairwiseOnDemand]: 102/107 looper letters, 13 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2022-12-05 18:39:46,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 105 transitions, 252 flow [2022-12-05 18:39:46,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 18:39:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 18:39:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2022-12-05 18:39:46,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9314641744548287 [2022-12-05 18:39:46,212 INFO L175 Difference]: Start difference. First operand has 112 places, 104 transitions, 217 flow. Second operand 3 states and 299 transitions. [2022-12-05 18:39:46,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 105 transitions, 252 flow [2022-12-05 18:39:46,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 105 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 18:39:46,221 INFO L231 Difference]: Finished difference. Result has 109 places, 100 transitions, 210 flow [2022-12-05 18:39:46,222 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=109, PETRI_TRANSITIONS=100} [2022-12-05 18:39:46,229 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, -3 predicate places. [2022-12-05 18:39:46,229 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 100 transitions, 210 flow [2022-12-05 18:39:46,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-05 18:39:46,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:46,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:46,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 18:39:46,231 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:46,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2120063092, now seen corresponding path program 1 times [2022-12-05 18:39:46,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:46,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610663910] [2022-12-05 18:39:46,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:46,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:47,128 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-05 18:39:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:47,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610663910] [2022-12-05 18:39:47,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610663910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:47,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:47,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:39:47,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199925544] [2022-12-05 18:39:47,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:47,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:39:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:47,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:39:47,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:39:47,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2022-12-05 18:39:47,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 100 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 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-05 18:39:47,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:47,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2022-12-05 18:39:47,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:48,356 INFO L130 PetriNetUnfolder]: 2377/5310 cut-off events. [2022-12-05 18:39:48,356 INFO L131 PetriNetUnfolder]: For 256/256 co-relation queries the response was YES. [2022-12-05 18:39:48,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9128 conditions, 5310 events. 2377/5310 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 42531 event pairs, 60 based on Foata normal form. 0/5158 useless extension candidates. Maximal degree in co-relation 9071. Up to 1339 conditions per place. [2022-12-05 18:39:48,379 INFO L137 encePairwiseOnDemand]: 93/107 looper letters, 39 selfloop transitions, 10 changer transitions 94/204 dead transitions. [2022-12-05 18:39:48,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 204 transitions, 708 flow [2022-12-05 18:39:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:39:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:39:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1086 transitions. [2022-12-05 18:39:48,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7807332854061826 [2022-12-05 18:39:48,385 INFO L175 Difference]: Start difference. First operand has 109 places, 100 transitions, 210 flow. Second operand 13 states and 1086 transitions. [2022-12-05 18:39:48,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 204 transitions, 708 flow [2022-12-05 18:39:48,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 204 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:39:48,389 INFO L231 Difference]: Finished difference. Result has 131 places, 98 transitions, 322 flow [2022-12-05 18:39:48,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=322, PETRI_PLACES=131, PETRI_TRANSITIONS=98} [2022-12-05 18:39:48,390 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 19 predicate places. [2022-12-05 18:39:48,390 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 98 transitions, 322 flow [2022-12-05 18:39:48,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 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-05 18:39:48,391 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:48,391 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:48,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 18:39:48,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash -953435373, now seen corresponding path program 1 times [2022-12-05 18:39:48,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:48,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947849997] [2022-12-05 18:39:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:48,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:48,928 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-05 18:39:48,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:48,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947849997] [2022-12-05 18:39:48,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947849997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:48,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:48,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:39:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875127906] [2022-12-05 18:39:48,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:48,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:39:48,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:48,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:39:48,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:39:48,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2022-12-05 18:39:48,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 98 transitions, 322 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 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-05 18:39:48,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:48,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2022-12-05 18:39:48,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:49,840 INFO L130 PetriNetUnfolder]: 1350/2401 cut-off events. [2022-12-05 18:39:49,840 INFO L131 PetriNetUnfolder]: For 7078/10881 co-relation queries the response was YES. [2022-12-05 18:39:49,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9656 conditions, 2401 events. 1350/2401 cut-off events. For 7078/10881 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13352 event pairs, 102 based on Foata normal form. 72/2394 useless extension candidates. Maximal degree in co-relation 9587. Up to 1149 conditions per place. [2022-12-05 18:39:49,860 INFO L137 encePairwiseOnDemand]: 93/107 looper letters, 44 selfloop transitions, 11 changer transitions 85/201 dead transitions. [2022-12-05 18:39:49,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 201 transitions, 1328 flow [2022-12-05 18:39:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:39:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:39:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1073 transitions. [2022-12-05 18:39:49,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7713874910136592 [2022-12-05 18:39:49,864 INFO L175 Difference]: Start difference. First operand has 131 places, 98 transitions, 322 flow. Second operand 13 states and 1073 transitions. [2022-12-05 18:39:49,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 201 transitions, 1328 flow [2022-12-05 18:39:49,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 201 transitions, 1302 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-05 18:39:49,886 INFO L231 Difference]: Finished difference. Result has 132 places, 104 transitions, 456 flow [2022-12-05 18:39:49,886 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=456, PETRI_PLACES=132, PETRI_TRANSITIONS=104} [2022-12-05 18:39:49,887 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 20 predicate places. [2022-12-05 18:39:49,888 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 104 transitions, 456 flow [2022-12-05 18:39:49,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 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-05 18:39:49,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:49,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:49,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 18:39:49,890 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:49,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:49,890 INFO L85 PathProgramCache]: Analyzing trace with hash 8722673, now seen corresponding path program 1 times [2022-12-05 18:39:49,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:49,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140004931] [2022-12-05 18:39:49,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:49,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:50,374 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-05 18:39:50,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:50,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140004931] [2022-12-05 18:39:50,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140004931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:50,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:50,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:39:50,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280198825] [2022-12-05 18:39:50,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:50,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:39:50,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:50,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:39:50,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:39:50,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2022-12-05 18:39:50,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 104 transitions, 456 flow. Second operand has 8 states, 8 states have (on average 75.75) internal successors, (606), 8 states have internal predecessors, (606), 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-05 18:39:50,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:50,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2022-12-05 18:39:50,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:51,007 INFO L130 PetriNetUnfolder]: 1123/2132 cut-off events. [2022-12-05 18:39:51,008 INFO L131 PetriNetUnfolder]: For 9468/16311 co-relation queries the response was YES. [2022-12-05 18:39:51,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9788 conditions, 2132 events. 1123/2132 cut-off events. For 9468/16311 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12425 event pairs, 108 based on Foata normal form. 51/2072 useless extension candidates. Maximal degree in co-relation 9707. Up to 1076 conditions per place. [2022-12-05 18:39:51,032 INFO L137 encePairwiseOnDemand]: 92/107 looper letters, 50 selfloop transitions, 16 changer transitions 68/195 dead transitions. [2022-12-05 18:39:51,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 195 transitions, 1565 flow [2022-12-05 18:39:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:39:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:39:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 904 transitions. [2022-12-05 18:39:51,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7680543755310111 [2022-12-05 18:39:51,035 INFO L175 Difference]: Start difference. First operand has 132 places, 104 transitions, 456 flow. Second operand 11 states and 904 transitions. [2022-12-05 18:39:51,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 195 transitions, 1565 flow [2022-12-05 18:39:51,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 195 transitions, 1480 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-12-05 18:39:51,065 INFO L231 Difference]: Finished difference. Result has 137 places, 108 transitions, 552 flow [2022-12-05 18:39:51,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=552, PETRI_PLACES=137, PETRI_TRANSITIONS=108} [2022-12-05 18:39:51,066 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 25 predicate places. [2022-12-05 18:39:51,067 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 108 transitions, 552 flow [2022-12-05 18:39:51,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.75) internal successors, (606), 8 states have internal predecessors, (606), 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-05 18:39:51,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:51,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:51,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 18:39:51,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash 513101202, now seen corresponding path program 1 times [2022-12-05 18:39:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:51,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958063504] [2022-12-05 18:39:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:51,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:51,531 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-05 18:39:51,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:51,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958063504] [2022-12-05 18:39:51,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958063504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:51,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:51,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:39:51,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706539178] [2022-12-05 18:39:51,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:51,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:39:51,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:51,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:39:51,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:39:51,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2022-12-05 18:39:51,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 108 transitions, 552 flow. Second operand has 8 states, 8 states have (on average 75.875) internal successors, (607), 8 states have internal predecessors, (607), 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-05 18:39:51,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:51,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2022-12-05 18:39:51,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:52,368 INFO L130 PetriNetUnfolder]: 1059/2160 cut-off events. [2022-12-05 18:39:52,368 INFO L131 PetriNetUnfolder]: For 8730/15449 co-relation queries the response was YES. [2022-12-05 18:39:52,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9845 conditions, 2160 events. 1059/2160 cut-off events. For 8730/15449 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13379 event pairs, 45 based on Foata normal form. 51/2132 useless extension candidates. Maximal degree in co-relation 9755. Up to 1046 conditions per place. [2022-12-05 18:39:52,393 INFO L137 encePairwiseOnDemand]: 91/107 looper letters, 41 selfloop transitions, 31 changer transitions 74/207 dead transitions. [2022-12-05 18:39:52,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 207 transitions, 1740 flow [2022-12-05 18:39:52,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:39:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:39:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1064 transitions. [2022-12-05 18:39:52,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7649173256649893 [2022-12-05 18:39:52,396 INFO L175 Difference]: Start difference. First operand has 137 places, 108 transitions, 552 flow. Second operand 13 states and 1064 transitions. [2022-12-05 18:39:52,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 207 transitions, 1740 flow [2022-12-05 18:39:52,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 207 transitions, 1503 flow, removed 82 selfloop flow, removed 18 redundant places. [2022-12-05 18:39:52,424 INFO L231 Difference]: Finished difference. Result has 136 places, 117 transitions, 650 flow [2022-12-05 18:39:52,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=650, PETRI_PLACES=136, PETRI_TRANSITIONS=117} [2022-12-05 18:39:52,425 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 24 predicate places. [2022-12-05 18:39:52,426 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 117 transitions, 650 flow [2022-12-05 18:39:52,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.875) internal successors, (607), 8 states have internal predecessors, (607), 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-05 18:39:52,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:52,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:52,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 18:39:52,427 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:52,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash -645319060, now seen corresponding path program 1 times [2022-12-05 18:39:52,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:52,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247797720] [2022-12-05 18:39:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:52,884 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-05 18:39:52,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:52,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247797720] [2022-12-05 18:39:52,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247797720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:52,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:52,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:39:52,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016219725] [2022-12-05 18:39:52,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:52,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:39:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:52,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:39:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:39:52,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2022-12-05 18:39:52,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 117 transitions, 650 flow. Second operand has 7 states, 7 states have (on average 76.42857142857143) internal successors, (535), 7 states have internal predecessors, (535), 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-05 18:39:52,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:52,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2022-12-05 18:39:52,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:53,307 INFO L130 PetriNetUnfolder]: 564/1192 cut-off events. [2022-12-05 18:39:53,307 INFO L131 PetriNetUnfolder]: For 5717/11801 co-relation queries the response was YES. [2022-12-05 18:39:53,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5741 conditions, 1192 events. 564/1192 cut-off events. For 5717/11801 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6348 event pairs, 67 based on Foata normal form. 35/1170 useless extension candidates. Maximal degree in co-relation 5653. Up to 584 conditions per place. [2022-12-05 18:39:53,317 INFO L137 encePairwiseOnDemand]: 94/107 looper letters, 39 selfloop transitions, 13 changer transitions 51/164 dead transitions. [2022-12-05 18:39:53,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 164 transitions, 1259 flow [2022-12-05 18:39:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:39:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:39:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 812 transitions. [2022-12-05 18:39:53,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7588785046728972 [2022-12-05 18:39:53,320 INFO L175 Difference]: Start difference. First operand has 136 places, 117 transitions, 650 flow. Second operand 10 states and 812 transitions. [2022-12-05 18:39:53,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 164 transitions, 1259 flow [2022-12-05 18:39:53,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 164 transitions, 1175 flow, removed 36 selfloop flow, removed 10 redundant places. [2022-12-05 18:39:53,337 INFO L231 Difference]: Finished difference. Result has 136 places, 107 transitions, 554 flow [2022-12-05 18:39:53,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=554, PETRI_PLACES=136, PETRI_TRANSITIONS=107} [2022-12-05 18:39:53,338 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 24 predicate places. [2022-12-05 18:39:53,338 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 107 transitions, 554 flow [2022-12-05 18:39:53,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.42857142857143) internal successors, (535), 7 states have internal predecessors, (535), 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-05 18:39:53,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:53,339 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:53,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 18:39:53,339 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:53,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2083280455, now seen corresponding path program 1 times [2022-12-05 18:39:53,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:53,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320893848] [2022-12-05 18:39:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:54,110 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-05 18:39:54,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:54,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320893848] [2022-12-05 18:39:54,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320893848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:54,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:54,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:39:54,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461264963] [2022-12-05 18:39:54,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:54,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:39:54,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:54,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:39:54,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:39:54,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-05 18:39:54,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 107 transitions, 554 flow. Second operand has 11 states, 11 states have (on average 81.63636363636364) internal successors, (898), 11 states have internal predecessors, (898), 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-05 18:39:54,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:54,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-05 18:39:54,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:54,458 INFO L130 PetriNetUnfolder]: 258/642 cut-off events. [2022-12-05 18:39:54,458 INFO L131 PetriNetUnfolder]: For 3204/4355 co-relation queries the response was YES. [2022-12-05 18:39:54,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2792 conditions, 642 events. 258/642 cut-off events. For 3204/4355 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2923 event pairs, 41 based on Foata normal form. 25/647 useless extension candidates. Maximal degree in co-relation 2702. Up to 286 conditions per place. [2022-12-05 18:39:54,464 INFO L137 encePairwiseOnDemand]: 94/107 looper letters, 32 selfloop transitions, 15 changer transitions 28/149 dead transitions. [2022-12-05 18:39:54,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 149 transitions, 1072 flow [2022-12-05 18:39:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:39:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:39:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1100 transitions. [2022-12-05 18:39:54,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7907979870596693 [2022-12-05 18:39:54,468 INFO L175 Difference]: Start difference. First operand has 136 places, 107 transitions, 554 flow. Second operand 13 states and 1100 transitions. [2022-12-05 18:39:54,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 149 transitions, 1072 flow [2022-12-05 18:39:54,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 149 transitions, 1026 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-12-05 18:39:54,475 INFO L231 Difference]: Finished difference. Result has 141 places, 116 transitions, 718 flow [2022-12-05 18:39:54,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=718, PETRI_PLACES=141, PETRI_TRANSITIONS=116} [2022-12-05 18:39:54,476 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 29 predicate places. [2022-12-05 18:39:54,476 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 116 transitions, 718 flow [2022-12-05 18:39:54,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.63636363636364) internal successors, (898), 11 states have internal predecessors, (898), 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-05 18:39:54,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:54,477 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:54,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 18:39:54,478 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:54,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:54,478 INFO L85 PathProgramCache]: Analyzing trace with hash -490419427, now seen corresponding path program 2 times [2022-12-05 18:39:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:54,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265678339] [2022-12-05 18:39:54,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:54,981 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-05 18:39:54,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:54,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265678339] [2022-12-05 18:39:54,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265678339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:54,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:54,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:39:54,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317173139] [2022-12-05 18:39:54,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:54,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:39:54,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:54,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:39:54,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:39:54,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-12-05 18:39:54,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 116 transitions, 718 flow. Second operand has 10 states, 10 states have (on average 83.6) internal successors, (836), 10 states have internal predecessors, (836), 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-05 18:39:54,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:54,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-12-05 18:39:54,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:55,311 INFO L130 PetriNetUnfolder]: 243/627 cut-off events. [2022-12-05 18:39:55,312 INFO L131 PetriNetUnfolder]: For 5566/6684 co-relation queries the response was YES. [2022-12-05 18:39:55,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3430 conditions, 627 events. 243/627 cut-off events. For 5566/6684 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2919 event pairs, 41 based on Foata normal form. 25/632 useless extension candidates. Maximal degree in co-relation 3337. Up to 275 conditions per place. [2022-12-05 18:39:55,319 INFO L137 encePairwiseOnDemand]: 94/107 looper letters, 26 selfloop transitions, 23 changer transitions 28/153 dead transitions. [2022-12-05 18:39:55,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 153 transitions, 1348 flow [2022-12-05 18:39:55,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:39:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:39:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1205 transitions. [2022-12-05 18:39:55,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8044058744993324 [2022-12-05 18:39:55,324 INFO L175 Difference]: Start difference. First operand has 141 places, 116 transitions, 718 flow. Second operand 14 states and 1205 transitions. [2022-12-05 18:39:55,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 153 transitions, 1348 flow [2022-12-05 18:39:55,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 153 transitions, 1277 flow, removed 11 selfloop flow, removed 9 redundant places. [2022-12-05 18:39:55,334 INFO L231 Difference]: Finished difference. Result has 146 places, 120 transitions, 825 flow [2022-12-05 18:39:55,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=825, PETRI_PLACES=146, PETRI_TRANSITIONS=120} [2022-12-05 18:39:55,336 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 34 predicate places. [2022-12-05 18:39:55,337 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 120 transitions, 825 flow [2022-12-05 18:39:55,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.6) internal successors, (836), 10 states have internal predecessors, (836), 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-05 18:39:55,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:55,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:55,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 18:39:55,338 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1702656193, now seen corresponding path program 1 times [2022-12-05 18:39:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:55,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772548187] [2022-12-05 18:39:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:55,555 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-05 18:39:55,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:55,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772548187] [2022-12-05 18:39:55,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772548187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:55,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:55,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:39:55,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311897631] [2022-12-05 18:39:55,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:55,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:39:55,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:55,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:39:55,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:39:55,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-05 18:39:55,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 120 transitions, 825 flow. Second operand has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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-05 18:39:55,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:55,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-05 18:39:55,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:56,017 INFO L130 PetriNetUnfolder]: 1041/2083 cut-off events. [2022-12-05 18:39:56,018 INFO L131 PetriNetUnfolder]: For 34442/35859 co-relation queries the response was YES. [2022-12-05 18:39:56,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10782 conditions, 2083 events. 1041/2083 cut-off events. For 34442/35859 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 13171 event pairs, 60 based on Foata normal form. 11/1969 useless extension candidates. Maximal degree in co-relation 10690. Up to 718 conditions per place. [2022-12-05 18:39:56,034 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 47 selfloop transitions, 9 changer transitions 49/182 dead transitions. [2022-12-05 18:39:56,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 182 transitions, 1726 flow [2022-12-05 18:39:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:39:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:39:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 906 transitions. [2022-12-05 18:39:56,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8467289719626169 [2022-12-05 18:39:56,037 INFO L175 Difference]: Start difference. First operand has 146 places, 120 transitions, 825 flow. Second operand 10 states and 906 transitions. [2022-12-05 18:39:56,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 182 transitions, 1726 flow [2022-12-05 18:39:56,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 182 transitions, 1437 flow, removed 102 selfloop flow, removed 15 redundant places. [2022-12-05 18:39:56,052 INFO L231 Difference]: Finished difference. Result has 141 places, 114 transitions, 611 flow [2022-12-05 18:39:56,053 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=611, PETRI_PLACES=141, PETRI_TRANSITIONS=114} [2022-12-05 18:39:56,053 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 29 predicate places. [2022-12-05 18:39:56,054 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 114 transitions, 611 flow [2022-12-05 18:39:56,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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-05 18:39:56,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:56,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:56,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 18:39:56,054 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash 887289966, now seen corresponding path program 1 times [2022-12-05 18:39:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:56,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350255113] [2022-12-05 18:39:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:39:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:56,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350255113] [2022-12-05 18:39:56,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350255113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:56,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:56,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:39:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083748074] [2022-12-05 18:39:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:56,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:39:56,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:56,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:39:56,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:39:56,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-05 18:39:56,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 114 transitions, 611 flow. Second operand has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-05 18:39:56,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:56,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-05 18:39:56,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:56,658 INFO L130 PetriNetUnfolder]: 570/1343 cut-off events. [2022-12-05 18:39:56,658 INFO L131 PetriNetUnfolder]: For 12419/12850 co-relation queries the response was YES. [2022-12-05 18:39:56,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6767 conditions, 1343 events. 570/1343 cut-off events. For 12419/12850 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8811 event pairs, 35 based on Foata normal form. 42/1324 useless extension candidates. Maximal degree in co-relation 6680. Up to 457 conditions per place. [2022-12-05 18:39:56,669 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 52 selfloop transitions, 20 changer transitions 47/196 dead transitions. [2022-12-05 18:39:56,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 196 transitions, 1806 flow [2022-12-05 18:39:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:39:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:39:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1173 transitions. [2022-12-05 18:39:56,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8432782171099928 [2022-12-05 18:39:56,673 INFO L175 Difference]: Start difference. First operand has 141 places, 114 transitions, 611 flow. Second operand 13 states and 1173 transitions. [2022-12-05 18:39:56,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 196 transitions, 1806 flow [2022-12-05 18:39:56,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 196 transitions, 1752 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-05 18:39:56,686 INFO L231 Difference]: Finished difference. Result has 153 places, 127 transitions, 773 flow [2022-12-05 18:39:56,687 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=773, PETRI_PLACES=153, PETRI_TRANSITIONS=127} [2022-12-05 18:39:56,687 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 41 predicate places. [2022-12-05 18:39:56,687 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 127 transitions, 773 flow [2022-12-05 18:39:56,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-05 18:39:56,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:56,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:56,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 18:39:56,688 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:56,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:56,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1054162039, now seen corresponding path program 1 times [2022-12-05 18:39:56,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:56,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357294627] [2022-12-05 18:39:56,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:56,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:56,894 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-05 18:39:56,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:56,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357294627] [2022-12-05 18:39:56,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357294627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:56,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:56,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:39:56,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007272804] [2022-12-05 18:39:56,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:56,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:39:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:56,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:39:56,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:39:56,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-05 18:39:56,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 127 transitions, 773 flow. Second operand has 8 states, 8 states have (on average 85.125) internal successors, (681), 8 states have internal predecessors, (681), 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-05 18:39:56,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:56,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-05 18:39:56,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:57,310 INFO L130 PetriNetUnfolder]: 493/1169 cut-off events. [2022-12-05 18:39:57,311 INFO L131 PetriNetUnfolder]: For 10870/11284 co-relation queries the response was YES. [2022-12-05 18:39:57,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6443 conditions, 1169 events. 493/1169 cut-off events. For 10870/11284 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7685 event pairs, 38 based on Foata normal form. 22/1134 useless extension candidates. Maximal degree in co-relation 6351. Up to 416 conditions per place. [2022-12-05 18:39:57,323 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 40 selfloop transitions, 18 changer transitions 60/195 dead transitions. [2022-12-05 18:39:57,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 195 transitions, 1802 flow [2022-12-05 18:39:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 18:39:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 18:39:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1413 transitions. [2022-12-05 18:39:57,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8253504672897196 [2022-12-05 18:39:57,328 INFO L175 Difference]: Start difference. First operand has 153 places, 127 transitions, 773 flow. Second operand 16 states and 1413 transitions. [2022-12-05 18:39:57,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 195 transitions, 1802 flow [2022-12-05 18:39:57,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 195 transitions, 1701 flow, removed 40 selfloop flow, removed 7 redundant places. [2022-12-05 18:39:57,348 INFO L231 Difference]: Finished difference. Result has 168 places, 122 transitions, 708 flow [2022-12-05 18:39:57,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=708, PETRI_PLACES=168, PETRI_TRANSITIONS=122} [2022-12-05 18:39:57,349 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 56 predicate places. [2022-12-05 18:39:57,349 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 122 transitions, 708 flow [2022-12-05 18:39:57,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.125) internal successors, (681), 8 states have internal predecessors, (681), 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-05 18:39:57,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:57,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:57,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 18:39:57,350 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:57,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:57,350 INFO L85 PathProgramCache]: Analyzing trace with hash 195420447, now seen corresponding path program 1 times [2022-12-05 18:39:57,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:57,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743094077] [2022-12-05 18:39:57,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:57,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:58,736 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-05 18:39:58,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:58,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743094077] [2022-12-05 18:39:58,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743094077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:58,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:58,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:39:58,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648085351] [2022-12-05 18:39:58,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:58,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:39:58,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:58,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:39:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:39:58,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 107 [2022-12-05 18:39:58,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 122 transitions, 708 flow. Second operand has 12 states, 12 states have (on average 72.66666666666667) internal successors, (872), 12 states have internal predecessors, (872), 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-05 18:39:58,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:58,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 107 [2022-12-05 18:39:58,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:59,289 INFO L130 PetriNetUnfolder]: 87/691 cut-off events. [2022-12-05 18:39:59,289 INFO L131 PetriNetUnfolder]: For 2290/2377 co-relation queries the response was YES. [2022-12-05 18:39:59,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 691 events. 87/691 cut-off events. For 2290/2377 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5623 event pairs, 4 based on Foata normal form. 1/656 useless extension candidates. Maximal degree in co-relation 2309. Up to 123 conditions per place. [2022-12-05 18:39:59,297 INFO L137 encePairwiseOnDemand]: 92/107 looper letters, 44 selfloop transitions, 21 changer transitions 7/147 dead transitions. [2022-12-05 18:39:59,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 147 transitions, 1022 flow [2022-12-05 18:39:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:39:59,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:39:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1045 transitions. [2022-12-05 18:39:59,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6975967957276369 [2022-12-05 18:39:59,300 INFO L175 Difference]: Start difference. First operand has 168 places, 122 transitions, 708 flow. Second operand 14 states and 1045 transitions. [2022-12-05 18:39:59,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 147 transitions, 1022 flow [2022-12-05 18:39:59,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 147 transitions, 877 flow, removed 58 selfloop flow, removed 15 redundant places. [2022-12-05 18:39:59,313 INFO L231 Difference]: Finished difference. Result has 167 places, 126 transitions, 724 flow [2022-12-05 18:39:59,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=724, PETRI_PLACES=167, PETRI_TRANSITIONS=126} [2022-12-05 18:39:59,315 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 55 predicate places. [2022-12-05 18:39:59,315 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 126 transitions, 724 flow [2022-12-05 18:39:59,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 72.66666666666667) internal successors, (872), 12 states have internal predecessors, (872), 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-05 18:39:59,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:59,316 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:59,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 18:39:59,316 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1955706179, now seen corresponding path program 2 times [2022-12-05 18:39:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:59,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070828539] [2022-12-05 18:39:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:40:00,608 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-05 18:40:00,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:40:00,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070828539] [2022-12-05 18:40:00,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070828539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:40:00,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:40:00,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:40:00,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143105567] [2022-12-05 18:40:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:40:00,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:40:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:40:00,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:40:00,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:40:00,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 107 [2022-12-05 18:40:00,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 126 transitions, 724 flow. Second operand has 13 states, 13 states have (on average 71.53846153846153) internal successors, (930), 13 states have internal predecessors, (930), 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-05 18:40:00,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:40:00,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 107 [2022-12-05 18:40:00,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:40:01,028 INFO L130 PetriNetUnfolder]: 114/895 cut-off events. [2022-12-05 18:40:01,028 INFO L131 PetriNetUnfolder]: For 1391/1416 co-relation queries the response was YES. [2022-12-05 18:40:01,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 895 events. 114/895 cut-off events. For 1391/1416 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8096 event pairs, 2 based on Foata normal form. 2/853 useless extension candidates. Maximal degree in co-relation 2468. Up to 158 conditions per place. [2022-12-05 18:40:01,035 INFO L137 encePairwiseOnDemand]: 92/107 looper letters, 33 selfloop transitions, 13 changer transitions 19/139 dead transitions. [2022-12-05 18:40:01,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 139 transitions, 927 flow [2022-12-05 18:40:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:40:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:40:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 948 transitions. [2022-12-05 18:40:01,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6815240833932422 [2022-12-05 18:40:01,037 INFO L175 Difference]: Start difference. First operand has 167 places, 126 transitions, 724 flow. Second operand 13 states and 948 transitions. [2022-12-05 18:40:01,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 139 transitions, 927 flow [2022-12-05 18:40:01,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 139 transitions, 871 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-12-05 18:40:01,049 INFO L231 Difference]: Finished difference. Result has 170 places, 117 transitions, 594 flow [2022-12-05 18:40:01,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=594, PETRI_PLACES=170, PETRI_TRANSITIONS=117} [2022-12-05 18:40:01,050 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 58 predicate places. [2022-12-05 18:40:01,050 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 117 transitions, 594 flow [2022-12-05 18:40:01,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 71.53846153846153) internal successors, (930), 13 states have internal predecessors, (930), 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-05 18:40:01,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:40:01,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:01,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 18:40:01,052 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:40:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:40:01,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1073799969, now seen corresponding path program 3 times [2022-12-05 18:40:01,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:40:01,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278301724] [2022-12-05 18:40:01,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:40:01,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:40:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:40:01,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 18:40:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:40:01,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 18:40:01,171 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 18:40:01,172 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 18:40:01,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 18:40:01,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 18:40:01,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 18:40:01,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 18:40:01,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 18:40:01,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 18:40:01,175 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:40:01,180 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 18:40:01,180 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 18:40:01,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 06:40:01 BasicIcfg [2022-12-05 18:40:01,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 18:40:01,289 INFO L158 Benchmark]: Toolchain (without parser) took 17571.02ms. Allocated memory was 183.5MB in the beginning and 507.5MB in the end (delta: 324.0MB). Free memory was 158.9MB in the beginning and 248.2MB in the end (delta: -89.3MB). Peak memory consumption was 235.2MB. Max. memory is 8.0GB. [2022-12-05 18:40:01,289 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 183.5MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:40:01,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.96ms. Allocated memory is still 183.5MB. Free memory was 158.4MB in the beginning and 132.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 18:40:01,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.35ms. Allocated memory is still 183.5MB. Free memory was 132.2MB in the beginning and 129.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:40:01,290 INFO L158 Benchmark]: Boogie Preprocessor took 49.84ms. Allocated memory is still 183.5MB. Free memory was 129.5MB in the beginning and 127.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:40:01,290 INFO L158 Benchmark]: RCFGBuilder took 766.15ms. Allocated memory is still 183.5MB. Free memory was 127.5MB in the beginning and 91.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-05 18:40:01,291 INFO L158 Benchmark]: TraceAbstraction took 16129.96ms. Allocated memory was 183.5MB in the beginning and 507.5MB in the end (delta: 324.0MB). Free memory was 91.3MB in the beginning and 248.2MB in the end (delta: -156.9MB). Peak memory consumption was 168.0MB. Max. memory is 8.0GB. [2022-12-05 18:40:01,292 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 183.5MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.96ms. Allocated memory is still 183.5MB. Free memory was 158.4MB in the beginning and 132.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.35ms. Allocated memory is still 183.5MB. Free memory was 132.2MB in the beginning and 129.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.84ms. Allocated memory is still 183.5MB. Free memory was 129.5MB in the beginning and 127.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 766.15ms. Allocated memory is still 183.5MB. Free memory was 127.5MB in the beginning and 91.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 16129.96ms. Allocated memory was 183.5MB in the beginning and 507.5MB in the end (delta: 324.0MB). Free memory was 91.3MB in the beginning and 248.2MB in the end (delta: -156.9MB). Peak memory consumption was 168.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1876; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-2, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1877; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=-1, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1878; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1878, ((void *)0), P2, ((void *)0))=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 819]: 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: 823]: 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, 134 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: 15.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1020 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1020 mSDsluCounter, 1074 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 847 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1758 IncrementalHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 227 mSDtfsCounter, 1758 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=825occurred in iteration=8, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 944 ConstructedInterpolants, 0 QuantifiedInterpolants, 5765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-05 18:40:01,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...