/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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 18:38:09,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 18:38:09,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 18:38:09,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 18:38:09,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 18:38:09,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 18:38:09,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 18:38:09,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 18:38:09,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 18:38:09,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 18:38:09,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 18:38:09,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 18:38:09,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 18:38:09,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 18:38:09,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 18:38:09,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 18:38:09,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 18:38:09,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 18:38:09,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 18:38:09,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 18:38:09,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 18:38:09,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 18:38:09,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 18:38:09,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 18:38:09,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 18:38:09,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 18:38:09,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 18:38:09,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 18:38:09,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 18:38:09,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 18:38:09,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 18:38:09,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 18:38:09,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 18:38:09,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 18:38:09,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 18:38:09,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 18:38:09,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 18:38:09,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 18:38:09,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 18:38:09,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 18:38:09,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 18:38:09,201 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:38:09,227 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 18:38:09,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 18:38:09,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 18:38:09,228 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 18:38:09,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 18:38:09,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 18:38:09,229 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 18:38:09,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 18:38:09,230 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 18:38:09,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 18:38:09,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 18:38:09,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 18:38:09,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 18:38:09,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 18:38:09,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 18:38:09,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 18:38:09,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 18:38:09,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 18:38:09,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 18:38:09,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 18:38:09,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 18:38:09,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 18:38:09,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 18:38:09,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:38:09,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 18:38:09,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 18:38:09,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 18:38:09,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 18:38:09,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 18:38:09,232 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 18:38:09,232 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 18:38:09,233 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:38:09,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 18:38:09,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 18:38:09,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 18:38:09,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 18:38:09,531 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 18:38:09,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:38:10,530 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 18:38:10,786 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 18:38:10,787 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:38:10,807 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34eb92143/dc3f1c6c0cda4054bf35adff6eabc5d8/FLAG1a65a2e78 [2022-12-05 18:38:10,819 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34eb92143/dc3f1c6c0cda4054bf35adff6eabc5d8 [2022-12-05 18:38:10,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 18:38:10,822 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 18:38:10,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 18:38:10,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 18:38:10,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 18:38:10,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:38:10" (1/1) ... [2022-12-05 18:38:10,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74df6d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:10, skipping insertion in model container [2022-12-05 18:38:10,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:38:10" (1/1) ... [2022-12-05 18:38:10,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 18:38:10,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 18:38:10,962 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 18:38:11,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:38:11,098 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 18:38:11,106 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 18:38:11,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:38:11,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:38:11,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:38:11,179 INFO L208 MainTranslator]: Completed translation [2022-12-05 18:38:11,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:11 WrapperNode [2022-12-05 18:38:11,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 18:38:11,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 18:38:11,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 18:38:11,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 18:38:11,186 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:38:11" (1/1) ... [2022-12-05 18:38:11,216 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:38:11" (1/1) ... [2022-12-05 18:38:11,244 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-05 18:38:11,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 18:38:11,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 18:38:11,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 18:38:11,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 18:38:11,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:11" (1/1) ... [2022-12-05 18:38:11,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:11" (1/1) ... [2022-12-05 18:38:11,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:11" (1/1) ... [2022-12-05 18:38:11,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:11" (1/1) ... [2022-12-05 18:38:11,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:11" (1/1) ... [2022-12-05 18:38:11,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:11" (1/1) ... [2022-12-05 18:38:11,270 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:11" (1/1) ... [2022-12-05 18:38:11,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:11" (1/1) ... [2022-12-05 18:38:11,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 18:38:11,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 18:38:11,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 18:38:11,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 18:38:11,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:11" (1/1) ... [2022-12-05 18:38:11,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:38:11,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 18:38:11,319 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:38:11,330 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:38:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 18:38:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 18:38:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 18:38:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 18:38:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 18:38:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 18:38:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 18:38:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 18:38:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 18:38:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 18:38:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 18:38:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 18:38:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 18:38:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 18:38:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 18:38:11,362 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:38:11,492 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 18:38:11,493 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 18:38:11,715 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 18:38:11,832 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 18:38:11,832 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 18:38:11,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:38:11 BoogieIcfgContainer [2022-12-05 18:38:11,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 18:38:11,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 18:38:11,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 18:38:11,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 18:38:11,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 06:38:10" (1/3) ... [2022-12-05 18:38:11,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549b9e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:38:11, skipping insertion in model container [2022-12-05 18:38:11,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:38:11" (2/3) ... [2022-12-05 18:38:11,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549b9e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:38:11, skipping insertion in model container [2022-12-05 18:38:11,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:38:11" (3/3) ... [2022-12-05 18:38:11,839 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:38:11,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 18:38:11,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 18:38:11,852 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 18:38:11,902 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 18:38:11,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 18:38:12,004 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 18:38:12,004 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:38:12,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 18:38:12,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 18:38:12,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-05 18:38:12,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 18:38:12,025 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;@7147eb21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 18:38:12,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 18:38:12,042 INFO L130 PetriNetUnfolder]: 0/69 cut-off events. [2022-12-05 18:38:12,043 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:38:12,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:12,043 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] [2022-12-05 18:38:12,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:12,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1769326636, now seen corresponding path program 1 times [2022-12-05 18:38:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:12,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078809693] [2022-12-05 18:38:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:12,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:12,595 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:38:12,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:12,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078809693] [2022-12-05 18:38:12,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078809693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:12,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:12,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 18:38:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401913676] [2022-12-05 18:38:12,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:12,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 18:38:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:12,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 18:38:12,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 18:38:12,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2022-12-05 18:38:12,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:38:12,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:12,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2022-12-05 18:38:12,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:12,759 INFO L130 PetriNetUnfolder]: 17/220 cut-off events. [2022-12-05 18:38:12,760 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 18:38:12,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 220 events. 17/220 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 674 event pairs, 7 based on Foata normal form. 9/217 useless extension candidates. Maximal degree in co-relation 224. Up to 27 conditions per place. [2022-12-05 18:38:12,762 INFO L137 encePairwiseOnDemand]: 101/106 looper letters, 10 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2022-12-05 18:38:12,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 237 flow [2022-12-05 18:38:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 18:38:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 18:38:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2022-12-05 18:38:12,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9308176100628931 [2022-12-05 18:38:12,775 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 215 flow. Second operand 3 states and 296 transitions. [2022-12-05 18:38:12,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 237 flow [2022-12-05 18:38:12,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 102 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 18:38:12,783 INFO L231 Difference]: Finished difference. Result has 108 places, 99 transitions, 208 flow [2022-12-05 18:38:12,784 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=108, PETRI_TRANSITIONS=99} [2022-12-05 18:38:12,789 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, -3 predicate places. [2022-12-05 18:38:12,789 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 208 flow [2022-12-05 18:38:12,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:38:12,789 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:12,790 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:38:12,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 18:38:12,790 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:12,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:12,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1632857268, now seen corresponding path program 1 times [2022-12-05 18:38:12,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:12,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528178441] [2022-12-05 18:38:12,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:12,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:13,432 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:38:13,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:13,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528178441] [2022-12-05 18:38:13,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528178441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:13,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:13,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:38:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941640221] [2022-12-05 18:38:13,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:13,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:38:13,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:38:13,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:38:13,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 106 [2022-12-05 18:38:13,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 99 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 77.71428571428571) internal successors, (544), 7 states have internal predecessors, (544), 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:38:13,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:13,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 106 [2022-12-05 18:38:13,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:14,145 INFO L130 PetriNetUnfolder]: 951/2743 cut-off events. [2022-12-05 18:38:14,145 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-05 18:38:14,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4457 conditions, 2743 events. 951/2743 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 22767 event pairs, 257 based on Foata normal form. 0/2652 useless extension candidates. Maximal degree in co-relation 4401. Up to 679 conditions per place. [2022-12-05 18:38:14,156 INFO L137 encePairwiseOnDemand]: 94/106 looper letters, 36 selfloop transitions, 10 changer transitions 79/188 dead transitions. [2022-12-05 18:38:14,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 188 transitions, 646 flow [2022-12-05 18:38:14,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:38:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:38:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1094 transitions. [2022-12-05 18:38:14,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7939042089985486 [2022-12-05 18:38:14,160 INFO L175 Difference]: Start difference. First operand has 108 places, 99 transitions, 208 flow. Second operand 13 states and 1094 transitions. [2022-12-05 18:38:14,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 188 transitions, 646 flow [2022-12-05 18:38:14,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 188 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:38:14,164 INFO L231 Difference]: Finished difference. Result has 129 places, 97 transitions, 289 flow [2022-12-05 18:38:14,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=289, PETRI_PLACES=129, PETRI_TRANSITIONS=97} [2022-12-05 18:38:14,164 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 18 predicate places. [2022-12-05 18:38:14,165 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 289 flow [2022-12-05 18:38:14,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.71428571428571) internal successors, (544), 7 states have internal predecessors, (544), 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:38:14,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:14,165 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:38:14,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 18:38:14,165 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1447190347, now seen corresponding path program 1 times [2022-12-05 18:38:14,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:14,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303214930] [2022-12-05 18:38:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:14,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:14,841 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:38:14,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:14,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303214930] [2022-12-05 18:38:14,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303214930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:14,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:14,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:38:14,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320581031] [2022-12-05 18:38:14,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:14,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:38:14,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:14,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:38:14,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:38:14,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 106 [2022-12-05 18:38:14,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 289 flow. Second operand has 10 states, 10 states have (on average 77.0) internal successors, (770), 10 states have internal predecessors, (770), 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:38:14,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:14,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 106 [2022-12-05 18:38:14,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:15,839 INFO L130 PetriNetUnfolder]: 820/1980 cut-off events. [2022-12-05 18:38:15,840 INFO L131 PetriNetUnfolder]: For 3306/3903 co-relation queries the response was YES. [2022-12-05 18:38:15,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6265 conditions, 1980 events. 820/1980 cut-off events. For 3306/3903 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14079 event pairs, 79 based on Foata normal form. 57/1992 useless extension candidates. Maximal degree in co-relation 6198. Up to 643 conditions per place. [2022-12-05 18:38:15,852 INFO L137 encePairwiseOnDemand]: 88/106 looper letters, 40 selfloop transitions, 36 changer transitions 117/256 dead transitions. [2022-12-05 18:38:15,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 256 transitions, 1617 flow [2022-12-05 18:38:15,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-05 18:38:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-05 18:38:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1890 transitions. [2022-12-05 18:38:15,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7752255947497949 [2022-12-05 18:38:15,857 INFO L175 Difference]: Start difference. First operand has 129 places, 97 transitions, 289 flow. Second operand 23 states and 1890 transitions. [2022-12-05 18:38:15,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 256 transitions, 1617 flow [2022-12-05 18:38:15,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 256 transitions, 1553 flow, removed 32 selfloop flow, removed 6 redundant places. [2022-12-05 18:38:15,876 INFO L231 Difference]: Finished difference. Result has 146 places, 125 transitions, 693 flow [2022-12-05 18:38:15,877 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=693, PETRI_PLACES=146, PETRI_TRANSITIONS=125} [2022-12-05 18:38:15,878 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 35 predicate places. [2022-12-05 18:38:15,878 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 125 transitions, 693 flow [2022-12-05 18:38:15,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.0) internal successors, (770), 10 states have internal predecessors, (770), 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:38:15,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:15,879 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:38:15,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 18:38:15,879 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:15,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:15,880 INFO L85 PathProgramCache]: Analyzing trace with hash 444903467, now seen corresponding path program 1 times [2022-12-05 18:38:15,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:15,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632831484] [2022-12-05 18:38:15,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:15,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:16,214 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:38:16,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:16,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632831484] [2022-12-05 18:38:16,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632831484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:16,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:16,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 18:38:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616163977] [2022-12-05 18:38:16,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:16,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 18:38:16,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:16,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 18:38:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-05 18:38:16,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-05 18:38:16,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 125 transitions, 693 flow. Second operand has 9 states, 9 states have (on average 85.55555555555556) internal successors, (770), 9 states have internal predecessors, (770), 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:38:16,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:16,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-05 18:38:16,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:16,481 INFO L130 PetriNetUnfolder]: 461/1115 cut-off events. [2022-12-05 18:38:16,481 INFO L131 PetriNetUnfolder]: For 10414/11603 co-relation queries the response was YES. [2022-12-05 18:38:16,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5830 conditions, 1115 events. 461/1115 cut-off events. For 10414/11603 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6764 event pairs, 67 based on Foata normal form. 78/1126 useless extension candidates. Maximal degree in co-relation 5745. Up to 475 conditions per place. [2022-12-05 18:38:16,491 INFO L137 encePairwiseOnDemand]: 98/106 looper letters, 37 selfloop transitions, 8 changer transitions 31/163 dead transitions. [2022-12-05 18:38:16,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 163 transitions, 1293 flow [2022-12-05 18:38:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:38:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:38:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 968 transitions. [2022-12-05 18:38:16,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8301886792452831 [2022-12-05 18:38:16,494 INFO L175 Difference]: Start difference. First operand has 146 places, 125 transitions, 693 flow. Second operand 11 states and 968 transitions. [2022-12-05 18:38:16,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 163 transitions, 1293 flow [2022-12-05 18:38:16,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 163 transitions, 1217 flow, removed 36 selfloop flow, removed 11 redundant places. [2022-12-05 18:38:16,508 INFO L231 Difference]: Finished difference. Result has 137 places, 125 transitions, 675 flow [2022-12-05 18:38:16,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=675, PETRI_PLACES=137, PETRI_TRANSITIONS=125} [2022-12-05 18:38:16,508 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 26 predicate places. [2022-12-05 18:38:16,509 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 125 transitions, 675 flow [2022-12-05 18:38:16,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.55555555555556) internal successors, (770), 9 states have internal predecessors, (770), 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:38:16,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:16,509 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] [2022-12-05 18:38:16,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 18:38:16,510 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:16,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:16,510 INFO L85 PathProgramCache]: Analyzing trace with hash -351211821, now seen corresponding path program 1 times [2022-12-05 18:38:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:16,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63694994] [2022-12-05 18:38:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:16,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:17,421 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:38:17,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:17,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63694994] [2022-12-05 18:38:17,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63694994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:17,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:17,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:38:17,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440919570] [2022-12-05 18:38:17,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:17,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:38:17,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:17,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:38:17,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:38:17,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 106 [2022-12-05 18:38:17,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 125 transitions, 675 flow. Second operand has 11 states, 11 states have (on average 76.9090909090909) internal successors, (846), 11 states have internal predecessors, (846), 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:38:17,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:17,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 106 [2022-12-05 18:38:17,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:18,054 INFO L130 PetriNetUnfolder]: 613/1519 cut-off events. [2022-12-05 18:38:18,055 INFO L131 PetriNetUnfolder]: For 10639/12193 co-relation queries the response was YES. [2022-12-05 18:38:18,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7279 conditions, 1519 events. 613/1519 cut-off events. For 10639/12193 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10047 event pairs, 92 based on Foata normal form. 99/1577 useless extension candidates. Maximal degree in co-relation 7189. Up to 625 conditions per place. [2022-12-05 18:38:18,068 INFO L137 encePairwiseOnDemand]: 90/106 looper letters, 82 selfloop transitions, 36 changer transitions 86/267 dead transitions. [2022-12-05 18:38:18,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 267 transitions, 2631 flow [2022-12-05 18:38:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 18:38:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 18:38:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1537 transitions. [2022-12-05 18:38:18,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7631578947368421 [2022-12-05 18:38:18,071 INFO L175 Difference]: Start difference. First operand has 137 places, 125 transitions, 675 flow. Second operand 19 states and 1537 transitions. [2022-12-05 18:38:18,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 267 transitions, 2631 flow [2022-12-05 18:38:18,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 267 transitions, 2574 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-12-05 18:38:18,097 INFO L231 Difference]: Finished difference. Result has 154 places, 155 transitions, 1142 flow [2022-12-05 18:38:18,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1142, PETRI_PLACES=154, PETRI_TRANSITIONS=155} [2022-12-05 18:38:18,100 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 43 predicate places. [2022-12-05 18:38:18,100 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 155 transitions, 1142 flow [2022-12-05 18:38:18,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 76.9090909090909) internal successors, (846), 11 states have internal predecessors, (846), 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:38:18,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:18,100 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] [2022-12-05 18:38:18,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 18:38:18,101 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash 634453903, now seen corresponding path program 2 times [2022-12-05 18:38:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:18,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973967233] [2022-12-05 18:38:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:18,557 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:38:18,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:18,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973967233] [2022-12-05 18:38:18,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973967233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:18,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:18,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:38:18,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724070042] [2022-12-05 18:38:18,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:18,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:38:18,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:38:18,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:38:18,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 106 [2022-12-05 18:38:18,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 155 transitions, 1142 flow. Second operand has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 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:38:18,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:18,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 106 [2022-12-05 18:38:18,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:18,886 INFO L130 PetriNetUnfolder]: 427/1227 cut-off events. [2022-12-05 18:38:18,886 INFO L131 PetriNetUnfolder]: For 10736/12858 co-relation queries the response was YES. [2022-12-05 18:38:18,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6202 conditions, 1227 events. 427/1227 cut-off events. For 10736/12858 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8367 event pairs, 57 based on Foata normal form. 82/1246 useless extension candidates. Maximal degree in co-relation 6105. Up to 449 conditions per place. [2022-12-05 18:38:18,899 INFO L137 encePairwiseOnDemand]: 93/106 looper letters, 41 selfloop transitions, 28 changer transitions 35/192 dead transitions. [2022-12-05 18:38:18,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 192 transitions, 1837 flow [2022-12-05 18:38:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 18:38:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 18:38:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1266 transitions. [2022-12-05 18:38:18,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7962264150943397 [2022-12-05 18:38:18,902 INFO L175 Difference]: Start difference. First operand has 154 places, 155 transitions, 1142 flow. Second operand 15 states and 1266 transitions. [2022-12-05 18:38:18,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 192 transitions, 1837 flow [2022-12-05 18:38:18,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 192 transitions, 1761 flow, removed 35 selfloop flow, removed 9 redundant places. [2022-12-05 18:38:18,949 INFO L231 Difference]: Finished difference. Result has 156 places, 156 transitions, 1197 flow [2022-12-05 18:38:18,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1197, PETRI_PLACES=156, PETRI_TRANSITIONS=156} [2022-12-05 18:38:18,951 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 45 predicate places. [2022-12-05 18:38:18,952 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 156 transitions, 1197 flow [2022-12-05 18:38:18,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 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:38:18,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:18,953 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:38:18,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 18:38:18,953 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:18,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:18,956 INFO L85 PathProgramCache]: Analyzing trace with hash -714914679, now seen corresponding path program 1 times [2022-12-05 18:38:18,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:18,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814352632] [2022-12-05 18:38:18,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:18,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:19,538 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:38:19,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:19,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814352632] [2022-12-05 18:38:19,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814352632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:19,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:19,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:38:19,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816792618] [2022-12-05 18:38:19,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:19,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:38:19,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:19,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:38:19,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:38:19,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-05 18:38:19,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 156 transitions, 1197 flow. Second operand has 10 states, 10 states have (on average 81.9) internal successors, (819), 10 states have internal predecessors, (819), 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:38:19,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:19,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-05 18:38:19,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:19,849 INFO L130 PetriNetUnfolder]: 381/1056 cut-off events. [2022-12-05 18:38:19,849 INFO L131 PetriNetUnfolder]: For 11851/16364 co-relation queries the response was YES. [2022-12-05 18:38:19,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5999 conditions, 1056 events. 381/1056 cut-off events. For 11851/16364 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6765 event pairs, 49 based on Foata normal form. 86/1092 useless extension candidates. Maximal degree in co-relation 5897. Up to 440 conditions per place. [2022-12-05 18:38:19,859 INFO L137 encePairwiseOnDemand]: 95/106 looper letters, 59 selfloop transitions, 25 changer transitions 31/202 dead transitions. [2022-12-05 18:38:19,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 202 transitions, 2147 flow [2022-12-05 18:38:19,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 18:38:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 18:38:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1012 transitions. [2022-12-05 18:38:19,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7955974842767296 [2022-12-05 18:38:19,862 INFO L175 Difference]: Start difference. First operand has 156 places, 156 transitions, 1197 flow. Second operand 12 states and 1012 transitions. [2022-12-05 18:38:19,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 202 transitions, 2147 flow [2022-12-05 18:38:19,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 202 transitions, 2068 flow, removed 22 selfloop flow, removed 12 redundant places. [2022-12-05 18:38:19,884 INFO L231 Difference]: Finished difference. Result has 159 places, 164 transitions, 1373 flow [2022-12-05 18:38:19,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1373, PETRI_PLACES=159, PETRI_TRANSITIONS=164} [2022-12-05 18:38:19,884 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 48 predicate places. [2022-12-05 18:38:19,885 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 164 transitions, 1373 flow [2022-12-05 18:38:19,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.9) internal successors, (819), 10 states have internal predecessors, (819), 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:38:19,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:19,885 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:38:19,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 18:38:19,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:19,886 INFO L85 PathProgramCache]: Analyzing trace with hash 415222317, now seen corresponding path program 2 times [2022-12-05 18:38:19,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:19,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937478996] [2022-12-05 18:38:19,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:19,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:20,280 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:38:20,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:20,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937478996] [2022-12-05 18:38:20,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937478996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:20,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:20,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:38:20,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655496856] [2022-12-05 18:38:20,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:20,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:38:20,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:20,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:38:20,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:38:20,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-05 18:38:20,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 164 transitions, 1373 flow. Second operand has 11 states, 11 states have (on average 83.54545454545455) internal successors, (919), 11 states have internal predecessors, (919), 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:38:20,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:20,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-05 18:38:20,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:20,663 INFO L130 PetriNetUnfolder]: 388/1095 cut-off events. [2022-12-05 18:38:20,663 INFO L131 PetriNetUnfolder]: For 17812/19633 co-relation queries the response was YES. [2022-12-05 18:38:20,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6918 conditions, 1095 events. 388/1095 cut-off events. For 17812/19633 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7111 event pairs, 39 based on Foata normal form. 87/1125 useless extension candidates. Maximal degree in co-relation 6819. Up to 452 conditions per place. [2022-12-05 18:38:20,675 INFO L137 encePairwiseOnDemand]: 95/106 looper letters, 57 selfloop transitions, 31 changer transitions 31/208 dead transitions. [2022-12-05 18:38:20,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 208 transitions, 2577 flow [2022-12-05 18:38:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:38:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:38:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1115 transitions. [2022-12-05 18:38:20,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.809143686502177 [2022-12-05 18:38:20,677 INFO L175 Difference]: Start difference. First operand has 159 places, 164 transitions, 1373 flow. Second operand 13 states and 1115 transitions. [2022-12-05 18:38:20,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 208 transitions, 2577 flow [2022-12-05 18:38:20,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 208 transitions, 2510 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-05 18:38:20,698 INFO L231 Difference]: Finished difference. Result has 167 places, 172 transitions, 1609 flow [2022-12-05 18:38:20,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1609, PETRI_PLACES=167, PETRI_TRANSITIONS=172} [2022-12-05 18:38:20,699 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 56 predicate places. [2022-12-05 18:38:20,699 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 172 transitions, 1609 flow [2022-12-05 18:38:20,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 83.54545454545455) internal successors, (919), 11 states have internal predecessors, (919), 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:38:20,700 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:20,700 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:38:20,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 18:38:20,700 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:20,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash 511505453, now seen corresponding path program 3 times [2022-12-05 18:38:20,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:20,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948126269] [2022-12-05 18:38:20,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:20,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:21,379 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:38:21,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:21,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948126269] [2022-12-05 18:38:21,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948126269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:21,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:21,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:38:21,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94968492] [2022-12-05 18:38:21,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:21,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:38:21,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:21,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:38:21,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:38:21,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 106 [2022-12-05 18:38:21,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 172 transitions, 1609 flow. Second operand has 10 states, 10 states have (on average 77.2) internal successors, (772), 10 states have internal predecessors, (772), 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:38:21,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:21,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 106 [2022-12-05 18:38:21,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:22,071 INFO L130 PetriNetUnfolder]: 474/1420 cut-off events. [2022-12-05 18:38:22,071 INFO L131 PetriNetUnfolder]: For 23563/26323 co-relation queries the response was YES. [2022-12-05 18:38:22,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8821 conditions, 1420 events. 474/1420 cut-off events. For 23563/26323 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10174 event pairs, 31 based on Foata normal form. 140/1522 useless extension candidates. Maximal degree in co-relation 8712. Up to 478 conditions per place. [2022-12-05 18:38:22,085 INFO L137 encePairwiseOnDemand]: 91/106 looper letters, 69 selfloop transitions, 84 changer transitions 73/289 dead transitions. [2022-12-05 18:38:22,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 289 transitions, 4326 flow [2022-12-05 18:38:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 18:38:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 18:38:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1465 transitions. [2022-12-05 18:38:22,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7678197064989518 [2022-12-05 18:38:22,087 INFO L175 Difference]: Start difference. First operand has 167 places, 172 transitions, 1609 flow. Second operand 18 states and 1465 transitions. [2022-12-05 18:38:22,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 289 transitions, 4326 flow [2022-12-05 18:38:22,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 289 transitions, 4053 flow, removed 135 selfloop flow, removed 8 redundant places. [2022-12-05 18:38:22,121 INFO L231 Difference]: Finished difference. Result has 184 places, 196 transitions, 2343 flow [2022-12-05 18:38:22,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2343, PETRI_PLACES=184, PETRI_TRANSITIONS=196} [2022-12-05 18:38:22,121 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 73 predicate places. [2022-12-05 18:38:22,122 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 196 transitions, 2343 flow [2022-12-05 18:38:22,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.2) internal successors, (772), 10 states have internal predecessors, (772), 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:38:22,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:22,122 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:38:22,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 18:38:22,122 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:22,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:22,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1564543598, now seen corresponding path program 1 times [2022-12-05 18:38:22,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:22,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428218883] [2022-12-05 18:38:22,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:22,693 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:38:22,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:22,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428218883] [2022-12-05 18:38:22,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428218883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:22,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:22,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:38:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483458496] [2022-12-05 18:38:22,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:22,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:38:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:22,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:38:22,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:38:22,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 106 [2022-12-05 18:38:22,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 196 transitions, 2343 flow. Second operand has 13 states, 13 states have (on average 80.61538461538461) internal successors, (1048), 13 states have internal predecessors, (1048), 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:38:22,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:22,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 106 [2022-12-05 18:38:22,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:23,054 INFO L130 PetriNetUnfolder]: 317/961 cut-off events. [2022-12-05 18:38:23,055 INFO L131 PetriNetUnfolder]: For 21196/23752 co-relation queries the response was YES. [2022-12-05 18:38:23,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6766 conditions, 961 events. 317/961 cut-off events. For 21196/23752 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6146 event pairs, 33 based on Foata normal form. 89/994 useless extension candidates. Maximal degree in co-relation 6648. Up to 376 conditions per place. [2022-12-05 18:38:23,065 INFO L137 encePairwiseOnDemand]: 94/106 looper letters, 73 selfloop transitions, 34 changer transitions 13/216 dead transitions. [2022-12-05 18:38:23,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 216 transitions, 3042 flow [2022-12-05 18:38:23,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:38:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:38:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1149 transitions. [2022-12-05 18:38:23,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7742587601078167 [2022-12-05 18:38:23,067 INFO L175 Difference]: Start difference. First operand has 184 places, 196 transitions, 2343 flow. Second operand 14 states and 1149 transitions. [2022-12-05 18:38:23,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 216 transitions, 3042 flow [2022-12-05 18:38:23,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 216 transitions, 2979 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-12-05 18:38:23,100 INFO L231 Difference]: Finished difference. Result has 186 places, 199 transitions, 2524 flow [2022-12-05 18:38:23,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2524, PETRI_PLACES=186, PETRI_TRANSITIONS=199} [2022-12-05 18:38:23,101 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 75 predicate places. [2022-12-05 18:38:23,101 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 199 transitions, 2524 flow [2022-12-05 18:38:23,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 80.61538461538461) internal successors, (1048), 13 states have internal predecessors, (1048), 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:38:23,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:23,101 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:38:23,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 18:38:23,101 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash 216991446, now seen corresponding path program 2 times [2022-12-05 18:38:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:23,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215857128] [2022-12-05 18:38:23,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:23,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:38:23,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:23,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215857128] [2022-12-05 18:38:23,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215857128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:23,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:23,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:38:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132017629] [2022-12-05 18:38:23,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:23,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:38:23,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:23,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:38:23,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:38:23,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 106 [2022-12-05 18:38:23,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 199 transitions, 2524 flow. Second operand has 11 states, 11 states have (on average 82.72727272727273) internal successors, (910), 11 states have internal predecessors, (910), 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:38:23,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:23,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 106 [2022-12-05 18:38:23,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:23,838 INFO L130 PetriNetUnfolder]: 327/1033 cut-off events. [2022-12-05 18:38:23,838 INFO L131 PetriNetUnfolder]: For 23805/26731 co-relation queries the response was YES. [2022-12-05 18:38:23,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7332 conditions, 1033 events. 327/1033 cut-off events. For 23805/26731 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7017 event pairs, 39 based on Foata normal form. 105/1080 useless extension candidates. Maximal degree in co-relation 7211. Up to 396 conditions per place. [2022-12-05 18:38:23,849 INFO L137 encePairwiseOnDemand]: 94/106 looper letters, 78 selfloop transitions, 30 changer transitions 13/219 dead transitions. [2022-12-05 18:38:23,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 219 transitions, 3293 flow [2022-12-05 18:38:23,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:38:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:38:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1095 transitions. [2022-12-05 18:38:23,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7946298984034833 [2022-12-05 18:38:23,851 INFO L175 Difference]: Start difference. First operand has 186 places, 199 transitions, 2524 flow. Second operand 13 states and 1095 transitions. [2022-12-05 18:38:23,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 219 transitions, 3293 flow [2022-12-05 18:38:23,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 219 transitions, 3078 flow, removed 84 selfloop flow, removed 12 redundant places. [2022-12-05 18:38:23,889 INFO L231 Difference]: Finished difference. Result has 187 places, 202 transitions, 2600 flow [2022-12-05 18:38:23,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=2393, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2600, PETRI_PLACES=187, PETRI_TRANSITIONS=202} [2022-12-05 18:38:23,890 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 76 predicate places. [2022-12-05 18:38:23,890 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 202 transitions, 2600 flow [2022-12-05 18:38:23,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.72727272727273) internal successors, (910), 11 states have internal predecessors, (910), 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:38:23,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:23,891 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:38:23,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 18:38:23,891 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:23,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1938712528, now seen corresponding path program 3 times [2022-12-05 18:38:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:23,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900413722] [2022-12-05 18:38:23,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:23,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:24,675 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:38:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:24,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900413722] [2022-12-05 18:38:24,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900413722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:24,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:24,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:38:24,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491260713] [2022-12-05 18:38:24,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:24,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:38:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:24,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:38:24,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:38:24,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-05 18:38:24,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 202 transitions, 2600 flow. Second operand has 13 states, 13 states have (on average 74.92307692307692) internal successors, (974), 13 states have internal predecessors, (974), 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:38:24,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:24,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-05 18:38:24,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:25,274 INFO L130 PetriNetUnfolder]: 401/1238 cut-off events. [2022-12-05 18:38:25,275 INFO L131 PetriNetUnfolder]: For 24962/30849 co-relation queries the response was YES. [2022-12-05 18:38:25,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8713 conditions, 1238 events. 401/1238 cut-off events. For 24962/30849 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8612 event pairs, 14 based on Foata normal form. 169/1368 useless extension candidates. Maximal degree in co-relation 8587. Up to 436 conditions per place. [2022-12-05 18:38:25,288 INFO L137 encePairwiseOnDemand]: 91/106 looper letters, 86 selfloop transitions, 90 changer transitions 28/265 dead transitions. [2022-12-05 18:38:25,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 265 transitions, 4249 flow [2022-12-05 18:38:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 18:38:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 18:38:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1471 transitions. [2022-12-05 18:38:25,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7303872889771599 [2022-12-05 18:38:25,290 INFO L175 Difference]: Start difference. First operand has 187 places, 202 transitions, 2600 flow. Second operand 19 states and 1471 transitions. [2022-12-05 18:38:25,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 265 transitions, 4249 flow [2022-12-05 18:38:25,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 265 transitions, 4046 flow, removed 79 selfloop flow, removed 10 redundant places. [2022-12-05 18:38:25,345 INFO L231 Difference]: Finished difference. Result has 203 places, 220 transitions, 3288 flow [2022-12-05 18:38:25,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=2486, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3288, PETRI_PLACES=203, PETRI_TRANSITIONS=220} [2022-12-05 18:38:25,346 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 92 predicate places. [2022-12-05 18:38:25,346 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 220 transitions, 3288 flow [2022-12-05 18:38:25,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 74.92307692307692) internal successors, (974), 13 states have internal predecessors, (974), 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:38:25,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:25,347 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:38:25,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 18:38:25,347 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1871000368, now seen corresponding path program 1 times [2022-12-05 18:38:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:25,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901654493] [2022-12-05 18:38:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:25,448 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:38:25,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:25,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901654493] [2022-12-05 18:38:25,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901654493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:25,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:25,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:38:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626462194] [2022-12-05 18:38:25,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:25,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:38:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:25,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:38:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:38:25,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-05 18:38:25,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 220 transitions, 3288 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:38:25,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:25,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-05 18:38:25,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:26,442 INFO L130 PetriNetUnfolder]: 2579/4960 cut-off events. [2022-12-05 18:38:26,442 INFO L131 PetriNetUnfolder]: For 163685/170686 co-relation queries the response was YES. [2022-12-05 18:38:26,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32303 conditions, 4960 events. 2579/4960 cut-off events. For 163685/170686 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 39176 event pairs, 64 based on Foata normal form. 648/5349 useless extension candidates. Maximal degree in co-relation 32177. Up to 1688 conditions per place. [2022-12-05 18:38:26,508 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 168 selfloop transitions, 7 changer transitions 182/475 dead transitions. [2022-12-05 18:38:26,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 475 transitions, 10033 flow [2022-12-05 18:38:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:38:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:38:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 904 transitions. [2022-12-05 18:38:26,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8528301886792453 [2022-12-05 18:38:26,512 INFO L175 Difference]: Start difference. First operand has 203 places, 220 transitions, 3288 flow. Second operand 10 states and 904 transitions. [2022-12-05 18:38:26,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 475 transitions, 10033 flow [2022-12-05 18:38:26,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 475 transitions, 9559 flow, removed 109 selfloop flow, removed 14 redundant places. [2022-12-05 18:38:26,650 INFO L231 Difference]: Finished difference. Result has 195 places, 207 transitions, 2819 flow [2022-12-05 18:38:26,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=2757, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2819, PETRI_PLACES=195, PETRI_TRANSITIONS=207} [2022-12-05 18:38:26,651 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 84 predicate places. [2022-12-05 18:38:26,652 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 207 transitions, 2819 flow [2022-12-05 18:38:26,652 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:38:26,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:26,652 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] [2022-12-05 18:38:26,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 18:38:26,652 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash -412911236, now seen corresponding path program 1 times [2022-12-05 18:38:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:26,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525343263] [2022-12-05 18:38:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:27,323 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:38:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:27,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525343263] [2022-12-05 18:38:27,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525343263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:27,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:27,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:38:27,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554322914] [2022-12-05 18:38:27,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:27,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:38:27,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:27,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:38:27,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:38:27,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-05 18:38:27,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 207 transitions, 2819 flow. Second operand has 11 states, 11 states have (on average 75.27272727272727) internal successors, (828), 11 states have internal predecessors, (828), 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:38:27,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:27,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-05 18:38:27,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:28,241 INFO L130 PetriNetUnfolder]: 774/2863 cut-off events. [2022-12-05 18:38:28,241 INFO L131 PetriNetUnfolder]: For 33162/35866 co-relation queries the response was YES. [2022-12-05 18:38:28,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14661 conditions, 2863 events. 774/2863 cut-off events. For 33162/35866 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 28482 event pairs, 196 based on Foata normal form. 131/2783 useless extension candidates. Maximal degree in co-relation 14529. Up to 749 conditions per place. [2022-12-05 18:38:28,278 INFO L137 encePairwiseOnDemand]: 92/106 looper letters, 106 selfloop transitions, 83 changer transitions 8/262 dead transitions. [2022-12-05 18:38:28,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 262 transitions, 4285 flow [2022-12-05 18:38:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 18:38:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 18:38:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1326 transitions. [2022-12-05 18:38:28,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7358490566037735 [2022-12-05 18:38:28,280 INFO L175 Difference]: Start difference. First operand has 195 places, 207 transitions, 2819 flow. Second operand 17 states and 1326 transitions. [2022-12-05 18:38:28,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 262 transitions, 4285 flow [2022-12-05 18:38:28,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 262 transitions, 4194 flow, removed 43 selfloop flow, removed 7 redundant places. [2022-12-05 18:38:28,353 INFO L231 Difference]: Finished difference. Result has 213 places, 225 transitions, 3570 flow [2022-12-05 18:38:28,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=2768, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3570, PETRI_PLACES=213, PETRI_TRANSITIONS=225} [2022-12-05 18:38:28,354 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 102 predicate places. [2022-12-05 18:38:28,354 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 225 transitions, 3570 flow [2022-12-05 18:38:28,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 75.27272727272727) internal successors, (828), 11 states have internal predecessors, (828), 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:38:28,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:28,354 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] [2022-12-05 18:38:28,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 18:38:28,355 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:28,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash -871904526, now seen corresponding path program 1 times [2022-12-05 18:38:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:28,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478848514] [2022-12-05 18:38:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:28,499 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:38:28,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:28,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478848514] [2022-12-05 18:38:28,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478848514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:28,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:28,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:38:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752736692] [2022-12-05 18:38:28,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:28,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:38:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:28,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:38:28,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:38:28,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-05 18:38:28,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 225 transitions, 3570 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:38:28,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:28,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-05 18:38:28,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:29,150 INFO L130 PetriNetUnfolder]: 1450/3663 cut-off events. [2022-12-05 18:38:29,150 INFO L131 PetriNetUnfolder]: For 84316/87061 co-relation queries the response was YES. [2022-12-05 18:38:29,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22630 conditions, 3663 events. 1450/3663 cut-off events. For 84316/87061 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 32679 event pairs, 45 based on Foata normal form. 391/4008 useless extension candidates. Maximal degree in co-relation 22499. Up to 1065 conditions per place. [2022-12-05 18:38:29,190 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 145 selfloop transitions, 20 changer transitions 110/388 dead transitions. [2022-12-05 18:38:29,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 388 transitions, 8160 flow [2022-12-05 18:38:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:38:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:38:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 995 transitions. [2022-12-05 18:38:29,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8533447684391081 [2022-12-05 18:38:29,192 INFO L175 Difference]: Start difference. First operand has 213 places, 225 transitions, 3570 flow. Second operand 11 states and 995 transitions. [2022-12-05 18:38:29,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 388 transitions, 8160 flow [2022-12-05 18:38:29,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 388 transitions, 7579 flow, removed 147 selfloop flow, removed 16 redundant places. [2022-12-05 18:38:29,296 INFO L231 Difference]: Finished difference. Result has 208 places, 191 transitions, 2493 flow [2022-12-05 18:38:29,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=2484, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2493, PETRI_PLACES=208, PETRI_TRANSITIONS=191} [2022-12-05 18:38:29,297 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 97 predicate places. [2022-12-05 18:38:29,297 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 191 transitions, 2493 flow [2022-12-05 18:38:29,297 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:38:29,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:29,297 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:38:29,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 18:38:29,298 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:29,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1924460785, now seen corresponding path program 1 times [2022-12-05 18:38:29,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:29,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460874649] [2022-12-05 18:38:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:29,424 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:38:29,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:29,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460874649] [2022-12-05 18:38:29,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460874649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:29,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:29,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:38:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637984197] [2022-12-05 18:38:29,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:29,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:38:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:29,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:38:29,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:38:29,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 106 [2022-12-05 18:38:29,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 191 transitions, 2493 flow. Second operand has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 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:38:29,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:29,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 106 [2022-12-05 18:38:29,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:29,782 INFO L130 PetriNetUnfolder]: 527/2426 cut-off events. [2022-12-05 18:38:29,783 INFO L131 PetriNetUnfolder]: For 17158/17631 co-relation queries the response was YES. [2022-12-05 18:38:29,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10484 conditions, 2426 events. 527/2426 cut-off events. For 17158/17631 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 25753 event pairs, 24 based on Foata normal form. 18/2309 useless extension candidates. Maximal degree in co-relation 10357. Up to 785 conditions per place. [2022-12-05 18:38:29,803 INFO L137 encePairwiseOnDemand]: 100/106 looper letters, 44 selfloop transitions, 11 changer transitions 73/232 dead transitions. [2022-12-05 18:38:29,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 232 transitions, 3651 flow [2022-12-05 18:38:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:38:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:38:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 810 transitions. [2022-12-05 18:38:29,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8490566037735849 [2022-12-05 18:38:29,805 INFO L175 Difference]: Start difference. First operand has 208 places, 191 transitions, 2493 flow. Second operand 9 states and 810 transitions. [2022-12-05 18:38:29,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 232 transitions, 3651 flow [2022-12-05 18:38:29,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 232 transitions, 3314 flow, removed 148 selfloop flow, removed 14 redundant places. [2022-12-05 18:38:29,878 INFO L231 Difference]: Finished difference. Result has 203 places, 151 transitions, 1437 flow [2022-12-05 18:38:29,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1437, PETRI_PLACES=203, PETRI_TRANSITIONS=151} [2022-12-05 18:38:29,879 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 92 predicate places. [2022-12-05 18:38:29,879 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 151 transitions, 1437 flow [2022-12-05 18:38:29,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 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:38:29,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:29,879 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:38:29,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 18:38:29,880 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash 882358861, now seen corresponding path program 1 times [2022-12-05 18:38:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:29,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460604301] [2022-12-05 18:38:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:30,007 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:38:30,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:30,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460604301] [2022-12-05 18:38:30,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460604301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:30,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:30,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:38:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491717056] [2022-12-05 18:38:30,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:30,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:38:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:30,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:38:30,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:38:30,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-05 18:38:30,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 151 transitions, 1437 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:38:30,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:30,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-05 18:38:30,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:30,392 INFO L130 PetriNetUnfolder]: 729/2083 cut-off events. [2022-12-05 18:38:30,392 INFO L131 PetriNetUnfolder]: For 32598/33903 co-relation queries the response was YES. [2022-12-05 18:38:30,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10536 conditions, 2083 events. 729/2083 cut-off events. For 32598/33903 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 17989 event pairs, 29 based on Foata normal form. 108/2169 useless extension candidates. Maximal degree in co-relation 10477. Up to 457 conditions per place. [2022-12-05 18:38:30,466 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 76 selfloop transitions, 24 changer transitions 68/251 dead transitions. [2022-12-05 18:38:30,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 251 transitions, 3691 flow [2022-12-05 18:38:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:38:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:38:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1237 transitions. [2022-12-05 18:38:30,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8335579514824798 [2022-12-05 18:38:30,468 INFO L175 Difference]: Start difference. First operand has 203 places, 151 transitions, 1437 flow. Second operand 14 states and 1237 transitions. [2022-12-05 18:38:30,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 251 transitions, 3691 flow [2022-12-05 18:38:30,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 251 transitions, 2832 flow, removed 274 selfloop flow, removed 28 redundant places. [2022-12-05 18:38:30,504 INFO L231 Difference]: Finished difference. Result has 188 places, 141 transitions, 1051 flow [2022-12-05 18:38:30,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1051, PETRI_PLACES=188, PETRI_TRANSITIONS=141} [2022-12-05 18:38:30,505 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 77 predicate places. [2022-12-05 18:38:30,505 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 141 transitions, 1051 flow [2022-12-05 18:38:30,506 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:38:30,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:30,506 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] [2022-12-05 18:38:30,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 18:38:30,506 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:30,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1008586653, now seen corresponding path program 1 times [2022-12-05 18:38:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:30,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779846548] [2022-12-05 18:38:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:38:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:38:30,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:38:30,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779846548] [2022-12-05 18:38:30,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779846548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:38:30,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:38:30,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:38:30,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938945533] [2022-12-05 18:38:30,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:38:30,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:38:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:38:30,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:38:30,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:38:30,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-05 18:38:30,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 141 transitions, 1051 flow. Second operand has 8 states, 8 states have (on average 76.5) internal successors, (612), 8 states have internal predecessors, (612), 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:38:30,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:38:30,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-05 18:38:30,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:38:31,069 INFO L130 PetriNetUnfolder]: 146/799 cut-off events. [2022-12-05 18:38:31,069 INFO L131 PetriNetUnfolder]: For 1910/1999 co-relation queries the response was YES. [2022-12-05 18:38:31,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2563 conditions, 799 events. 146/799 cut-off events. For 1910/1999 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6563 event pairs, 0 based on Foata normal form. 1/744 useless extension candidates. Maximal degree in co-relation 2522. Up to 110 conditions per place. [2022-12-05 18:38:31,074 INFO L137 encePairwiseOnDemand]: 94/106 looper letters, 25 selfloop transitions, 5 changer transitions 52/163 dead transitions. [2022-12-05 18:38:31,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 163 transitions, 1465 flow [2022-12-05 18:38:31,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:38:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:38:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 707 transitions. [2022-12-05 18:38:31,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7410901467505241 [2022-12-05 18:38:31,077 INFO L175 Difference]: Start difference. First operand has 188 places, 141 transitions, 1051 flow. Second operand 9 states and 707 transitions. [2022-12-05 18:38:31,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 163 transitions, 1465 flow [2022-12-05 18:38:31,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 163 transitions, 1236 flow, removed 74 selfloop flow, removed 22 redundant places. [2022-12-05 18:38:31,088 INFO L231 Difference]: Finished difference. Result has 176 places, 111 transitions, 524 flow [2022-12-05 18:38:31,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=524, PETRI_PLACES=176, PETRI_TRANSITIONS=111} [2022-12-05 18:38:31,088 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 65 predicate places. [2022-12-05 18:38:31,088 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 111 transitions, 524 flow [2022-12-05 18:38:31,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.5) internal successors, (612), 8 states have internal predecessors, (612), 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:38:31,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:38:31,089 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] [2022-12-05 18:38:31,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 18:38:31,089 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:38:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:38:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1434930331, now seen corresponding path program 2 times [2022-12-05 18:38:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:38:31,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951259554] [2022-12-05 18:38:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:38:31,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:38:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:38:31,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 18:38:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:38:31,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 18:38:31,167 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 18:38:31,168 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 18:38:31,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 18:38:31,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 18:38:31,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 18:38:31,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 18:38:31,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 18:38:31,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 18:38:31,170 INFO L458 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:38:31,174 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 18:38:31,174 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 18:38:31,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 06:38:31 BasicIcfg [2022-12-05 18:38:31,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 18:38:31,261 INFO L158 Benchmark]: Toolchain (without parser) took 20438.38ms. Allocated memory was 189.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 164.7MB in the beginning and 805.6MB in the end (delta: -640.9MB). Peak memory consumption was 378.5MB. Max. memory is 8.0GB. [2022-12-05 18:38:31,261 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory was 166.4MB in the beginning and 166.4MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:38:31,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.58ms. Allocated memory is still 189.8MB. Free memory was 164.4MB in the beginning and 138.7MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 18:38:31,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.48ms. Allocated memory is still 189.8MB. Free memory was 138.7MB in the beginning and 135.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 18:38:31,262 INFO L158 Benchmark]: Boogie Preprocessor took 28.07ms. Allocated memory is still 189.8MB. Free memory was 135.5MB in the beginning and 134.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 18:38:31,262 INFO L158 Benchmark]: RCFGBuilder took 560.75ms. Allocated memory is still 189.8MB. Free memory was 134.0MB in the beginning and 102.0MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-05 18:38:31,262 INFO L158 Benchmark]: TraceAbstraction took 19424.27ms. Allocated memory was 189.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 100.9MB in the beginning and 805.6MB in the end (delta: -704.7MB). Peak memory consumption was 314.5MB. Max. memory is 8.0GB. [2022-12-05 18:38:31,263 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.12ms. Allocated memory is still 189.8MB. Free memory was 166.4MB in the beginning and 166.4MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 356.58ms. Allocated memory is still 189.8MB. Free memory was 164.4MB in the beginning and 138.7MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.48ms. Allocated memory is still 189.8MB. Free memory was 138.7MB in the beginning and 135.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.07ms. Allocated memory is still 189.8MB. Free memory was 135.5MB in the beginning and 134.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 560.75ms. Allocated memory is still 189.8MB. Free memory was 134.0MB in the beginning and 102.0MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 19424.27ms. Allocated memory was 189.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 100.9MB in the beginning and 805.6MB in the end (delta: -704.7MB). Peak memory consumption was 314.5MB. 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] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1492; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1185 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1185 mSDsluCounter, 1630 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1319 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2561 IncrementalHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 311 mSDtfsCounter, 2561 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3570occurred in iteration=14, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1392 NumberOfCodeBlocks, 1392 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1292 ConstructedInterpolants, 0 QuantifiedInterpolants, 8546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:38:31,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...