/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:33:46,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:33:46,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:33:46,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:33:46,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:33:46,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:33:46,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:33:46,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:33:46,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:33:46,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:33:46,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:33:46,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:33:46,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:33:46,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:33:46,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:33:46,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:33:46,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:33:46,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:33:46,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:33:46,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:33:46,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:33:46,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:33:46,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:33:46,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:33:46,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:33:46,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:33:46,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:33:46,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:33:46,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:33:46,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:33:46,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:33:46,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:33:46,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:33:46,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:33:46,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:33:46,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:33:46,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:33:46,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:33:46,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:33:46,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:33:46,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:33:46,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 18:33:46,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:33:46,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:33:46,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:33:46,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:33:46,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:33:46,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:33:46,144 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:33:46,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:33:46,145 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:33:46,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:33:46,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:33:46,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:33:46,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:33:46,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:33:46,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:33:46,146 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:33:46,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:33:46,146 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:33:46,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:33:46,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:33:46,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:33:46,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:33:46,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:33:46,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:33:46,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:33:46,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:33:46,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:33:46,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:33:46,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:33:46,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:33:46,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 18:33:46,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:33:46,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:33:46,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:33:46,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:33:46,411 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:33:46,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2022-12-12 18:33:47,404 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:33:47,617 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:33:47,618 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2022-12-12 18:33:47,654 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32c3e3af/b81927c3955148898dbc88a80bfd998c/FLAG7c5bc2145 [2022-12-12 18:33:47,665 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32c3e3af/b81927c3955148898dbc88a80bfd998c [2022-12-12 18:33:47,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:33:47,668 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:33:47,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:33:47,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:33:47,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:33:47,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:33:47" (1/1) ... [2022-12-12 18:33:47,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d278be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:47, skipping insertion in model container [2022-12-12 18:33:47,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:33:47" (1/1) ... [2022-12-12 18:33:47,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:33:47,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:33:47,874 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i[949,962] [2022-12-12 18:33:48,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:33:48,106 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:33:48,122 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i[949,962] [2022-12-12 18:33:48,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:48,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:48,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:33:48,224 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:33:48,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48 WrapperNode [2022-12-12 18:33:48,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:33:48,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:33:48,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:33:48,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:33:48,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (1/1) ... [2022-12-12 18:33:48,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (1/1) ... [2022-12-12 18:33:48,281 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-12 18:33:48,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:33:48,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:33:48,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:33:48,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:33:48,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (1/1) ... [2022-12-12 18:33:48,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (1/1) ... [2022-12-12 18:33:48,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (1/1) ... [2022-12-12 18:33:48,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (1/1) ... [2022-12-12 18:33:48,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (1/1) ... [2022-12-12 18:33:48,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (1/1) ... [2022-12-12 18:33:48,302 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (1/1) ... [2022-12-12 18:33:48,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (1/1) ... [2022-12-12 18:33:48,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:33:48,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:33:48,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:33:48,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:33:48,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (1/1) ... [2022-12-12 18:33:48,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:33:48,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:33:48,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 18:33:48,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 18:33:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:33:48,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:33:48,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:33:48,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:33:48,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:33:48,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:33:48,371 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:33:48,456 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:33:48,458 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:33:48,695 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:33:48,899 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:33:48,899 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:33:48,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:33:48 BoogieIcfgContainer [2022-12-12 18:33:48,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:33:48,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:33:48,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:33:48,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:33:48,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:33:47" (1/3) ... [2022-12-12 18:33:48,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d39371b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:33:48, skipping insertion in model container [2022-12-12 18:33:48,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:48" (2/3) ... [2022-12-12 18:33:48,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d39371b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:33:48, skipping insertion in model container [2022-12-12 18:33:48,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:33:48" (3/3) ... [2022-12-12 18:33:48,906 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2022-12-12 18:33:48,921 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:33:48,921 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:33:48,921 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:33:48,979 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:33:49,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-12 18:33:49,063 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-12 18:33:49,063 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:33:49,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-12 18:33:49,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-12 18:33:49,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-12 18:33:49,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:33:49,087 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-12 18:33:49,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-12 18:33:49,122 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-12 18:33:49,122 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:33:49,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-12 18:33:49,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-12 18:33:49,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 1994 [2022-12-12 18:33:55,346 INFO L241 LiptonReduction]: Total number of compositions: 86 [2022-12-12 18:33:55,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:33:55,369 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;@7e576124, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:33:55,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 18:33:55,373 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-12 18:33:55,373 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:33:55,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:55,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 18:33:55,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:33:55,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:55,378 INFO L85 PathProgramCache]: Analyzing trace with hash 483742250, now seen corresponding path program 1 times [2022-12-12 18:33:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:55,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516909028] [2022-12-12 18:33:55,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:55,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:55,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:55,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516909028] [2022-12-12 18:33:55,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516909028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:55,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:55,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:33:55,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67005661] [2022-12-12 18:33:55,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:55,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:33:55,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:55,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:33:55,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:33:55,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 62 [2022-12-12 18:33:55,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:55,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:55,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 62 [2022-12-12 18:33:55,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:56,952 INFO L130 PetriNetUnfolder]: 7924/12849 cut-off events. [2022-12-12 18:33:56,953 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-12 18:33:56,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24251 conditions, 12849 events. 7924/12849 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 98494 event pairs, 1048 based on Foata normal form. 0/7896 useless extension candidates. Maximal degree in co-relation 24240. Up to 9597 conditions per place. [2022-12-12 18:33:56,988 INFO L137 encePairwiseOnDemand]: 57/62 looper letters, 32 selfloop transitions, 2 changer transitions 52/98 dead transitions. [2022-12-12 18:33:56,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 380 flow [2022-12-12 18:33:56,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:33:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:33:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-12-12 18:33:56,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6827956989247311 [2022-12-12 18:33:57,000 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 0 predicate places. [2022-12-12 18:33:57,001 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 98 transitions, 380 flow [2022-12-12 18:33:57,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 46 transitions, 172 flow [2022-12-12 18:33:57,020 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 172 flow [2022-12-12 18:33:57,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:57,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:57,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:57,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:33:57,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:33:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:57,022 INFO L85 PathProgramCache]: Analyzing trace with hash 868175786, now seen corresponding path program 1 times [2022-12-12 18:33:57,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:57,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821720057] [2022-12-12 18:33:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:57,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:57,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821720057] [2022-12-12 18:33:57,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821720057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:57,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:57,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:33:57,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331943701] [2022-12-12 18:33:57,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:57,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:33:57,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:57,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:33:57,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:33:57,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 62 [2022-12-12 18:33:57,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:57,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:57,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 62 [2022-12-12 18:33:57,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:57,792 INFO L130 PetriNetUnfolder]: 2231/3430 cut-off events. [2022-12-12 18:33:57,792 INFO L131 PetriNetUnfolder]: For 567/567 co-relation queries the response was YES. [2022-12-12 18:33:57,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9436 conditions, 3430 events. 2231/3430 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16782 event pairs, 241 based on Foata normal form. 72/3020 useless extension candidates. Maximal degree in co-relation 9422. Up to 2425 conditions per place. [2022-12-12 18:33:57,813 INFO L137 encePairwiseOnDemand]: 59/62 looper letters, 54 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2022-12-12 18:33:57,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 352 flow [2022-12-12 18:33:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:33:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:33:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-12 18:33:57,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 18:33:57,816 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2022-12-12 18:33:57,816 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 64 transitions, 352 flow [2022-12-12 18:33:57,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 64 transitions, 352 flow [2022-12-12 18:33:57,830 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 64 transitions, 352 flow [2022-12-12 18:33:57,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:57,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:57,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:57,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:33:57,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:33:57,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1092892039, now seen corresponding path program 1 times [2022-12-12 18:33:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:57,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900606087] [2022-12-12 18:33:57,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:57,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:58,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:58,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900606087] [2022-12-12 18:33:58,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900606087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:58,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:58,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:33:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279972281] [2022-12-12 18:33:58,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:58,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:33:58,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:33:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:33:58,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 18:33:58,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 64 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:58,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:58,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 18:33:58,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:58,418 INFO L130 PetriNetUnfolder]: 2203/3375 cut-off events. [2022-12-12 18:33:58,419 INFO L131 PetriNetUnfolder]: For 1748/1748 co-relation queries the response was YES. [2022-12-12 18:33:58,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12109 conditions, 3375 events. 2203/3375 cut-off events. For 1748/1748 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16353 event pairs, 199 based on Foata normal form. 10/2905 useless extension candidates. Maximal degree in co-relation 12092. Up to 2710 conditions per place. [2022-12-12 18:33:58,439 INFO L137 encePairwiseOnDemand]: 56/62 looper letters, 66 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2022-12-12 18:33:58,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 90 transitions, 662 flow [2022-12-12 18:33:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:33:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:33:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-12 18:33:58,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2022-12-12 18:33:58,443 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2022-12-12 18:33:58,444 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 90 transitions, 662 flow [2022-12-12 18:33:58,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 90 transitions, 662 flow [2022-12-12 18:33:58,457 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 90 transitions, 662 flow [2022-12-12 18:33:58,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:58,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:58,457 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:58,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:33:58,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:33:58,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash -479087023, now seen corresponding path program 1 times [2022-12-12 18:33:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:58,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618398015] [2022-12-12 18:33:58,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:59,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:59,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618398015] [2022-12-12 18:33:59,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618398015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:59,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:59,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:33:59,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861278703] [2022-12-12 18:33:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:59,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:33:59,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:59,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:33:59,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:33:59,029 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 18:33:59,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 90 transitions, 662 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:59,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:59,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 18:33:59,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:59,416 INFO L130 PetriNetUnfolder]: 2307/3561 cut-off events. [2022-12-12 18:33:59,416 INFO L131 PetriNetUnfolder]: For 4054/4054 co-relation queries the response was YES. [2022-12-12 18:33:59,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15554 conditions, 3561 events. 2307/3561 cut-off events. For 4054/4054 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 17912 event pairs, 163 based on Foata normal form. 12/3093 useless extension candidates. Maximal degree in co-relation 15534. Up to 2816 conditions per place. [2022-12-12 18:33:59,437 INFO L137 encePairwiseOnDemand]: 54/62 looper letters, 81 selfloop transitions, 13 changer transitions 0/106 dead transitions. [2022-12-12 18:33:59,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 106 transitions, 977 flow [2022-12-12 18:33:59,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:33:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:33:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-12 18:33:59,438 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-12 18:33:59,440 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -18 predicate places. [2022-12-12 18:33:59,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 106 transitions, 977 flow [2022-12-12 18:33:59,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 106 transitions, 977 flow [2022-12-12 18:33:59,458 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 106 transitions, 977 flow [2022-12-12 18:33:59,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:59,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:59,458 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:59,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:33:59,458 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:33:59,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:59,459 INFO L85 PathProgramCache]: Analyzing trace with hash -480009583, now seen corresponding path program 2 times [2022-12-12 18:33:59,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:59,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456305886] [2022-12-12 18:33:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:59,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:00,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:00,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456305886] [2022-12-12 18:34:00,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456305886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:00,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:00,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:34:00,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890263089] [2022-12-12 18:34:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:00,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:34:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:00,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:34:00,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:34:00,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 62 [2022-12-12 18:34:00,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 106 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:00,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:00,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 62 [2022-12-12 18:34:00,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:00,455 INFO L130 PetriNetUnfolder]: 2522/3841 cut-off events. [2022-12-12 18:34:00,456 INFO L131 PetriNetUnfolder]: For 4403/4403 co-relation queries the response was YES. [2022-12-12 18:34:00,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20578 conditions, 3841 events. 2522/3841 cut-off events. For 4403/4403 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 18959 event pairs, 153 based on Foata normal form. 35/3375 useless extension candidates. Maximal degree in co-relation 20555. Up to 3145 conditions per place. [2022-12-12 18:34:00,479 INFO L137 encePairwiseOnDemand]: 51/62 looper letters, 125 selfloop transitions, 43 changer transitions 0/176 dead transitions. [2022-12-12 18:34:00,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 176 transitions, 1961 flow [2022-12-12 18:34:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:34:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:34:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-12 18:34:00,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36129032258064514 [2022-12-12 18:34:00,482 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -14 predicate places. [2022-12-12 18:34:00,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 176 transitions, 1961 flow [2022-12-12 18:34:00,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 176 transitions, 1961 flow [2022-12-12 18:34:00,501 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 176 transitions, 1961 flow [2022-12-12 18:34:00,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:00,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:00,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:00,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:34:00,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:00,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:00,502 INFO L85 PathProgramCache]: Analyzing trace with hash 876465560, now seen corresponding path program 1 times [2022-12-12 18:34:00,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:00,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548230498] [2022-12-12 18:34:00,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:00,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:00,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:00,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548230498] [2022-12-12 18:34:00,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548230498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:00,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:00,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:34:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296179324] [2022-12-12 18:34:00,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:00,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:34:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:00,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:34:00,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:34:00,768 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 18:34:00,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 176 transitions, 1961 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:00,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:00,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 18:34:00,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:01,125 INFO L130 PetriNetUnfolder]: 2475/3776 cut-off events. [2022-12-12 18:34:01,125 INFO L131 PetriNetUnfolder]: For 7397/7397 co-relation queries the response was YES. [2022-12-12 18:34:01,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23297 conditions, 3776 events. 2475/3776 cut-off events. For 7397/7397 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 18636 event pairs, 137 based on Foata normal form. 22/3306 useless extension candidates. Maximal degree in co-relation 23271. Up to 3080 conditions per place. [2022-12-12 18:34:01,147 INFO L137 encePairwiseOnDemand]: 55/62 looper letters, 136 selfloop transitions, 22 changer transitions 0/180 dead transitions. [2022-12-12 18:34:01,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 180 transitions, 2325 flow [2022-12-12 18:34:01,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:34:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:34:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-12 18:34:01,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-12 18:34:01,149 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -11 predicate places. [2022-12-12 18:34:01,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 180 transitions, 2325 flow [2022-12-12 18:34:01,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 180 transitions, 2325 flow [2022-12-12 18:34:01,168 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 180 transitions, 2325 flow [2022-12-12 18:34:01,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:01,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:01,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:01,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:34:01,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:01,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1422040134, now seen corresponding path program 1 times [2022-12-12 18:34:01,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:01,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207493512] [2022-12-12 18:34:01,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:01,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:01,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207493512] [2022-12-12 18:34:01,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207493512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:01,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:01,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:34:01,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136614876] [2022-12-12 18:34:01,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:01,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:34:01,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:01,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:34:01,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:34:01,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 18:34:01,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 180 transitions, 2325 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:01,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:01,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 18:34:01,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:01,887 INFO L130 PetriNetUnfolder]: 2533/3862 cut-off events. [2022-12-12 18:34:01,888 INFO L131 PetriNetUnfolder]: For 11731/11731 co-relation queries the response was YES. [2022-12-12 18:34:01,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26986 conditions, 3862 events. 2533/3862 cut-off events. For 11731/11731 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19137 event pairs, 129 based on Foata normal form. 10/3374 useless extension candidates. Maximal degree in co-relation 26957. Up to 3164 conditions per place. [2022-12-12 18:34:01,911 INFO L137 encePairwiseOnDemand]: 54/62 looper letters, 145 selfloop transitions, 27 changer transitions 0/194 dead transitions. [2022-12-12 18:34:01,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 194 transitions, 2868 flow [2022-12-12 18:34:01,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:34:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:34:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-12-12 18:34:01,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2022-12-12 18:34:01,913 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -7 predicate places. [2022-12-12 18:34:01,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 194 transitions, 2868 flow [2022-12-12 18:34:01,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 194 transitions, 2868 flow [2022-12-12 18:34:01,931 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 194 transitions, 2868 flow [2022-12-12 18:34:01,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:01,931 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:01,931 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:01,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:34:01,931 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:01,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1400704160, now seen corresponding path program 2 times [2022-12-12 18:34:01,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:01,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801610437] [2022-12-12 18:34:01,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:01,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:02,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:02,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801610437] [2022-12-12 18:34:02,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801610437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:02,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:02,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:34:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730858984] [2022-12-12 18:34:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:02,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:34:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:02,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:34:02,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:34:02,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 18:34:02,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 194 transitions, 2868 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:02,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:02,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 18:34:02,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:02,694 INFO L130 PetriNetUnfolder]: 2586/3942 cut-off events. [2022-12-12 18:34:02,694 INFO L131 PetriNetUnfolder]: For 17030/17030 co-relation queries the response was YES. [2022-12-12 18:34:02,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30775 conditions, 3942 events. 2586/3942 cut-off events. For 17030/17030 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19717 event pairs, 136 based on Foata normal form. 10/3449 useless extension candidates. Maximal degree in co-relation 30743. Up to 3246 conditions per place. [2022-12-12 18:34:02,722 INFO L137 encePairwiseOnDemand]: 54/62 looper letters, 159 selfloop transitions, 36 changer transitions 0/217 dead transitions. [2022-12-12 18:34:02,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 217 transitions, 3626 flow [2022-12-12 18:34:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:34:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:34:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-12-12 18:34:02,723 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2022-12-12 18:34:02,725 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -3 predicate places. [2022-12-12 18:34:02,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 217 transitions, 3626 flow [2022-12-12 18:34:02,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 217 transitions, 3626 flow [2022-12-12 18:34:02,746 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 217 transitions, 3626 flow [2022-12-12 18:34:02,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:02,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:02,746 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:02,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:34:02,746 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1965579956, now seen corresponding path program 3 times [2022-12-12 18:34:02,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:02,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022019530] [2022-12-12 18:34:02,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:02,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:02,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:02,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022019530] [2022-12-12 18:34:02,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022019530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:02,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:02,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:34:02,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686704703] [2022-12-12 18:34:02,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:02,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:34:02,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:02,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:34:02,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:34:02,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 18:34:02,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 217 transitions, 3626 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:02,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:02,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 18:34:02,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:03,486 INFO L130 PetriNetUnfolder]: 2808/4274 cut-off events. [2022-12-12 18:34:03,486 INFO L131 PetriNetUnfolder]: For 24601/24601 co-relation queries the response was YES. [2022-12-12 18:34:03,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37093 conditions, 4274 events. 2808/4274 cut-off events. For 24601/24601 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 21592 event pairs, 139 based on Foata normal form. 25/3748 useless extension candidates. Maximal degree in co-relation 37058. Up to 3578 conditions per place. [2022-12-12 18:34:03,521 INFO L137 encePairwiseOnDemand]: 54/62 looper letters, 155 selfloop transitions, 64 changer transitions 0/241 dead transitions. [2022-12-12 18:34:03,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 241 transitions, 4499 flow [2022-12-12 18:34:03,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:34:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:34:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-12 18:34:03,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2022-12-12 18:34:03,523 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2022-12-12 18:34:03,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 241 transitions, 4499 flow [2022-12-12 18:34:03,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 241 transitions, 4499 flow [2022-12-12 18:34:03,554 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 241 transitions, 4499 flow [2022-12-12 18:34:03,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:03,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:03,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:03,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:34:03,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:03,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash -892388576, now seen corresponding path program 1 times [2022-12-12 18:34:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:03,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841341969] [2022-12-12 18:34:03,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:03,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:03,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841341969] [2022-12-12 18:34:03,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841341969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:03,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:03,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:34:03,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126764830] [2022-12-12 18:34:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:03,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:34:03,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:03,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:34:03,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:34:03,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 62 [2022-12-12 18:34:03,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 241 transitions, 4499 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:03,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:03,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 62 [2022-12-12 18:34:03,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:04,697 INFO L130 PetriNetUnfolder]: 4077/6294 cut-off events. [2022-12-12 18:34:04,697 INFO L131 PetriNetUnfolder]: For 36144/36144 co-relation queries the response was YES. [2022-12-12 18:34:04,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60840 conditions, 6294 events. 4077/6294 cut-off events. For 36144/36144 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 35542 event pairs, 129 based on Foata normal form. 114/5500 useless extension candidates. Maximal degree in co-relation 60802. Up to 5434 conditions per place. [2022-12-12 18:34:04,758 INFO L137 encePairwiseOnDemand]: 54/62 looper letters, 288 selfloop transitions, 31 changer transitions 110/437 dead transitions. [2022-12-12 18:34:04,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 437 transitions, 9101 flow [2022-12-12 18:34:04,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:34:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:34:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-12-12 18:34:04,760 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31989247311827956 [2022-12-12 18:34:04,760 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 7 predicate places. [2022-12-12 18:34:04,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 437 transitions, 9101 flow [2022-12-12 18:34:04,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 327 transitions, 6831 flow [2022-12-12 18:34:04,787 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 327 transitions, 6831 flow [2022-12-12 18:34:04,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:04,787 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:04,787 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:04,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:34:04,787 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:04,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash 413552546, now seen corresponding path program 2 times [2022-12-12 18:34:04,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:04,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758254357] [2022-12-12 18:34:04,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:04,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:04,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:04,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758254357] [2022-12-12 18:34:04,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758254357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:04,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:04,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:34:04,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879708834] [2022-12-12 18:34:04,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:04,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:34:04,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:04,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:34:04,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:34:04,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 62 [2022-12-12 18:34:04,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 327 transitions, 6831 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:04,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:04,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 62 [2022-12-12 18:34:04,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:05,802 INFO L130 PetriNetUnfolder]: 4613/7530 cut-off events. [2022-12-12 18:34:05,802 INFO L131 PetriNetUnfolder]: For 77836/78658 co-relation queries the response was YES. [2022-12-12 18:34:05,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75316 conditions, 7530 events. 4613/7530 cut-off events. For 77836/78658 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 49556 event pairs, 325 based on Foata normal form. 557/6936 useless extension candidates. Maximal degree in co-relation 75275. Up to 6258 conditions per place. [2022-12-12 18:34:05,843 INFO L137 encePairwiseOnDemand]: 50/62 looper letters, 217 selfloop transitions, 48 changer transitions 249/545 dead transitions. [2022-12-12 18:34:05,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 545 transitions, 12509 flow [2022-12-12 18:34:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:34:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:34:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-12-12 18:34:05,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2022-12-12 18:34:05,845 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 11 predicate places. [2022-12-12 18:34:05,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 545 transitions, 12509 flow [2022-12-12 18:34:05,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 296 transitions, 6653 flow [2022-12-12 18:34:05,877 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 296 transitions, 6653 flow [2022-12-12 18:34:05,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:05,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:05,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:05,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:34:05,878 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash 216199283, now seen corresponding path program 1 times [2022-12-12 18:34:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:05,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542042579] [2022-12-12 18:34:05,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:05,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:05,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542042579] [2022-12-12 18:34:05,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542042579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:05,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:05,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:34:05,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671448904] [2022-12-12 18:34:05,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:05,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:34:05,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:05,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:34:05,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:34:05,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 62 [2022-12-12 18:34:05,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 296 transitions, 6653 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:05,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:05,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 62 [2022-12-12 18:34:05,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:06,527 INFO L130 PetriNetUnfolder]: 2261/4114 cut-off events. [2022-12-12 18:34:06,528 INFO L131 PetriNetUnfolder]: For 48398/49062 co-relation queries the response was YES. [2022-12-12 18:34:06,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45000 conditions, 4114 events. 2261/4114 cut-off events. For 48398/49062 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 27654 event pairs, 106 based on Foata normal form. 597/4137 useless extension candidates. Maximal degree in co-relation 44956. Up to 3446 conditions per place. [2022-12-12 18:34:06,563 INFO L137 encePairwiseOnDemand]: 50/62 looper letters, 180 selfloop transitions, 73 changer transitions 129/413 dead transitions. [2022-12-12 18:34:06,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 413 transitions, 10048 flow [2022-12-12 18:34:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:34:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:34:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2022-12-12 18:34:06,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2022-12-12 18:34:06,566 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 14 predicate places. [2022-12-12 18:34:06,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 413 transitions, 10048 flow [2022-12-12 18:34:06,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 284 transitions, 6814 flow [2022-12-12 18:34:06,585 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 284 transitions, 6814 flow [2022-12-12 18:34:06,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:06,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:06,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:06,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:34:06,586 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:06,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:06,586 INFO L85 PathProgramCache]: Analyzing trace with hash 762995013, now seen corresponding path program 1 times [2022-12-12 18:34:06,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:06,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577316108] [2022-12-12 18:34:06,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:06,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:06,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:06,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577316108] [2022-12-12 18:34:06,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577316108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:06,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:06,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:34:06,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407744518] [2022-12-12 18:34:06,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:06,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:34:06,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:06,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:34:06,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:34:06,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 62 [2022-12-12 18:34:06,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 284 transitions, 6814 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:06,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:06,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 62 [2022-12-12 18:34:06,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:07,059 INFO L130 PetriNetUnfolder]: 1033/1981 cut-off events. [2022-12-12 18:34:07,059 INFO L131 PetriNetUnfolder]: For 26770/27112 co-relation queries the response was YES. [2022-12-12 18:34:07,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23380 conditions, 1981 events. 1033/1981 cut-off events. For 26770/27112 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11793 event pairs, 9 based on Foata normal form. 327/2043 useless extension candidates. Maximal degree in co-relation 23333. Up to 1616 conditions per place. [2022-12-12 18:34:07,070 INFO L137 encePairwiseOnDemand]: 50/62 looper letters, 116 selfloop transitions, 58 changer transitions 105/300 dead transitions. [2022-12-12 18:34:07,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 300 transitions, 7708 flow [2022-12-12 18:34:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:34:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:34:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2022-12-12 18:34:07,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3248847926267281 [2022-12-12 18:34:07,072 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 18 predicate places. [2022-12-12 18:34:07,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 300 transitions, 7708 flow [2022-12-12 18:34:07,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 195 transitions, 4968 flow [2022-12-12 18:34:07,082 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 195 transitions, 4968 flow [2022-12-12 18:34:07,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:07,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:07,082 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:07,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 18:34:07,083 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1848311457, now seen corresponding path program 1 times [2022-12-12 18:34:07,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:07,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370257962] [2022-12-12 18:34:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:07,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:07,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:07,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370257962] [2022-12-12 18:34:07,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370257962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:07,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:07,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:34:07,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951064459] [2022-12-12 18:34:07,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:07,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:34:07,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:07,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:34:07,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:34:07,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 62 [2022-12-12 18:34:07,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 195 transitions, 4968 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:07,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:07,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 62 [2022-12-12 18:34:07,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:07,638 INFO L130 PetriNetUnfolder]: 1008/1865 cut-off events. [2022-12-12 18:34:07,638 INFO L131 PetriNetUnfolder]: For 22849/23061 co-relation queries the response was YES. [2022-12-12 18:34:07,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23916 conditions, 1865 events. 1008/1865 cut-off events. For 22849/23061 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10352 event pairs, 0 based on Foata normal form. 55/1614 useless extension candidates. Maximal degree in co-relation 23866. Up to 1522 conditions per place. [2022-12-12 18:34:07,647 INFO L137 encePairwiseOnDemand]: 56/62 looper letters, 91 selfloop transitions, 6 changer transitions 181/289 dead transitions. [2022-12-12 18:34:07,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 289 transitions, 8049 flow [2022-12-12 18:34:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:34:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:34:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-12 18:34:07,648 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29838709677419356 [2022-12-12 18:34:07,648 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 18 predicate places. [2022-12-12 18:34:07,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 289 transitions, 8049 flow [2022-12-12 18:34:07,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 108 transitions, 2888 flow [2022-12-12 18:34:07,655 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 108 transitions, 2888 flow [2022-12-12 18:34:07,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:07,655 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:07,655 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:07,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 18:34:07,655 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:07,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash 655931743, now seen corresponding path program 1 times [2022-12-12 18:34:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:07,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514206962] [2022-12-12 18:34:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:07,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:08,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:08,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514206962] [2022-12-12 18:34:08,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514206962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:08,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:08,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 18:34:08,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849759426] [2022-12-12 18:34:08,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:08,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 18:34:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:08,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 18:34:08,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-12 18:34:08,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2022-12-12 18:34:08,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 108 transitions, 2888 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:08,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:08,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2022-12-12 18:34:08,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:08,749 INFO L130 PetriNetUnfolder]: 662/1426 cut-off events. [2022-12-12 18:34:08,750 INFO L131 PetriNetUnfolder]: For 11858/11976 co-relation queries the response was YES. [2022-12-12 18:34:08,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19312 conditions, 1426 events. 662/1426 cut-off events. For 11858/11976 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9195 event pairs, 0 based on Foata normal form. 41/1178 useless extension candidates. Maximal degree in co-relation 19259. Up to 1292 conditions per place. [2022-12-12 18:34:08,759 INFO L137 encePairwiseOnDemand]: 55/62 looper letters, 94 selfloop transitions, 10 changer transitions 69/187 dead transitions. [2022-12-12 18:34:08,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 187 transitions, 5592 flow [2022-12-12 18:34:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:34:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:34:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2022-12-12 18:34:08,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2022-12-12 18:34:08,761 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 13 predicate places. [2022-12-12 18:34:08,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 187 transitions, 5592 flow [2022-12-12 18:34:08,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 118 transitions, 3430 flow [2022-12-12 18:34:08,769 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 118 transitions, 3430 flow [2022-12-12 18:34:08,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:08,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:08,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:08,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 18:34:08,770 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:08,770 INFO L85 PathProgramCache]: Analyzing trace with hash -700437981, now seen corresponding path program 2 times [2022-12-12 18:34:08,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:08,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311366051] [2022-12-12 18:34:08,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:08,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:34:08,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:34:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:34:08,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:34:08,843 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:34:08,843 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 18:34:08,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 18:34:08,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 18:34:08,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 18:34:08,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 18:34:08,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 18:34:08,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 18:34:08,845 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:08,849 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:34:08,849 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:34:08,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:34:08 BasicIcfg [2022-12-12 18:34:08,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:34:08,890 INFO L158 Benchmark]: Toolchain (without parser) took 21221.80ms. Allocated memory was 223.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 181.7MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 293.1MB. Max. memory is 8.0GB. [2022-12-12 18:34:08,890 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 223.3MB. Free memory was 199.4MB in the beginning and 199.2MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:34:08,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.76ms. Allocated memory is still 223.3MB. Free memory was 181.2MB in the beginning and 155.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 18:34:08,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.79ms. Allocated memory is still 223.3MB. Free memory was 155.0MB in the beginning and 152.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 18:34:08,890 INFO L158 Benchmark]: Boogie Preprocessor took 23.75ms. Allocated memory is still 223.3MB. Free memory was 152.4MB in the beginning and 150.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:34:08,891 INFO L158 Benchmark]: RCFGBuilder took 594.75ms. Allocated memory is still 223.3MB. Free memory was 150.3MB in the beginning and 115.1MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-12 18:34:08,891 INFO L158 Benchmark]: TraceAbstraction took 19986.79ms. Allocated memory was 223.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 113.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 224.9MB. Max. memory is 8.0GB. [2022-12-12 18:34:08,892 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.10ms. Allocated memory is still 223.3MB. Free memory was 199.4MB in the beginning and 199.2MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 555.76ms. Allocated memory is still 223.3MB. Free memory was 181.2MB in the beginning and 155.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.79ms. Allocated memory is still 223.3MB. Free memory was 155.0MB in the beginning and 152.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.75ms. Allocated memory is still 223.3MB. Free memory was 152.4MB in the beginning and 150.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 594.75ms. Allocated memory is still 223.3MB. Free memory was 150.3MB in the beginning and 115.1MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 19986.79ms. Allocated memory was 223.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 113.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 224.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 115 PlacesBefore, 71 PlacesAfterwards, 107 TransitionsBefore, 62 TransitionsAfterwards, 1994 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 3678, independent unconditional: 0, dependent: 131, dependent conditional: 131, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 0, independent unconditional: 3678, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 0, independent unconditional: 3678, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 0, independent unconditional: 3678, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2040, independent: 1976, independent conditional: 0, independent unconditional: 1976, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2040, independent: 1939, independent conditional: 0, independent unconditional: 1939, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 319, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3809, independent: 1702, independent conditional: 0, independent unconditional: 1702, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 2040, unknown conditional: 0, unknown unconditional: 2040] , Statistics on independence cache: Total cache size (in pairs): 3738, Positive cache size: 3674, Positive conditional cache size: 0, Positive unconditional cache size: 3674, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-3, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=-2, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=-1, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.3s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 552 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 552 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1675 IncrementalHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 30 mSDtfsCounter, 1675 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6831occurred in iteration=10, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 21631 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 2946 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:34:08,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...