/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:42:27,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:42:27,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:42:27,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:42:27,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:42:27,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:42:27,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:42:27,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:42:27,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:42:27,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:42:27,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:42:27,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:42:27,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:42:27,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:42:27,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:42:27,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:42:27,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:42:27,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:42:27,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:42:27,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:42:27,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:42:27,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:42:27,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:42:27,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:42:27,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:42:27,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:42:27,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:42:27,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:42:27,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:42:27,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:42:27,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:42:27,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:42:27,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:42:27,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:42:27,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:42:27,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:42:27,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:42:27,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:42:27,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:42:27,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:42:27,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:42:27,232 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 14:42:27,259 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:42:27,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:42:27,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:42:27,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:42:27,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:42:27,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:42:27,261 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:42:27,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:42:27,262 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:42:27,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:42:27,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:42:27,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:42:27,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:42:27,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:42:27,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:42:27,263 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:42:27,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:42:27,263 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:42:27,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:42:27,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:42:27,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:42:27,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:42:27,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:42:27,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:42:27,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:42:27,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:42:27,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:42:27,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:42:27,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:42:27,264 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:42:27,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-12 14:42:27,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:42:27,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:42:27,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:42:27,557 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:42:27,557 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:42:27,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2022-12-12 14:42:28,595 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:42:28,842 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:42:28,843 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2022-12-12 14:42:28,853 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a2aa907/8e7cdbdfb76740e9bf59a601bf1ffcd6/FLAGd4e1f68b6 [2022-12-12 14:42:28,865 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a2aa907/8e7cdbdfb76740e9bf59a601bf1ffcd6 [2022-12-12 14:42:28,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:42:28,868 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:42:28,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:42:28,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:42:28,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:42:28,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:42:28" (1/1) ... [2022-12-12 14:42:28,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327a5854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:28, skipping insertion in model container [2022-12-12 14:42:28,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:42:28" (1/1) ... [2022-12-12 14:42:28,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:42:28,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:42:29,002 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-12 14:42:29,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:42:29,181 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:42:29,190 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-12 14:42:29,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:42:29,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:42:29,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:42:29,276 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:42:29,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29 WrapperNode [2022-12-12 14:42:29,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:42:29,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:42:29,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:42:29,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:42:29,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (1/1) ... [2022-12-12 14:42:29,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (1/1) ... [2022-12-12 14:42:29,332 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-12 14:42:29,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:42:29,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:42:29,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:42:29,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:42:29,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (1/1) ... [2022-12-12 14:42:29,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (1/1) ... [2022-12-12 14:42:29,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (1/1) ... [2022-12-12 14:42:29,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (1/1) ... [2022-12-12 14:42:29,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (1/1) ... [2022-12-12 14:42:29,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (1/1) ... [2022-12-12 14:42:29,372 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (1/1) ... [2022-12-12 14:42:29,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (1/1) ... [2022-12-12 14:42:29,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:42:29,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:42:29,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:42:29,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:42:29,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (1/1) ... [2022-12-12 14:42:29,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:42:29,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:42:29,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 14:42:29,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 14:42:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:42:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:42:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:42:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:42:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:42:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:42:29,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:42:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:42:29,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:42:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:42:29,436 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:42:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:42:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:42:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:42:29,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:42:29,437 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:42:29,546 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:42:29,547 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:42:29,841 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:42:29,960 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:42:29,960 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:42:29,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:42:29 BoogieIcfgContainer [2022-12-12 14:42:29,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:42:29,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:42:29,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:42:29,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:42:29,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:42:28" (1/3) ... [2022-12-12 14:42:29,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141e4e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:42:29, skipping insertion in model container [2022-12-12 14:42:29,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:42:29" (2/3) ... [2022-12-12 14:42:29,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141e4e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:42:29, skipping insertion in model container [2022-12-12 14:42:29,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:42:29" (3/3) ... [2022-12-12 14:42:29,970 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2022-12-12 14:42:29,982 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:42:29,982 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:42:29,982 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:42:30,029 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:42:30,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 14:42:30,108 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 14:42:30,108 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:42:30,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 14:42:30,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 14:42:30,117 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-12 14:42:30,119 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:42:30,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 14:42:30,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-12 14:42:30,166 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 14:42:30,166 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:42:30,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 14:42:30,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 14:42:30,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-12 14:42:37,323 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-12 14:42:37,333 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:42:37,338 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;@58b6d7dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:42:37,338 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 14:42:37,341 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-12 14:42:37,341 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:42:37,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:37,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:37,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:37,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:37,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1789848918, now seen corresponding path program 1 times [2022-12-12 14:42:37,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:37,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186630081] [2022-12-12 14:42:37,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:37,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:37,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:37,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186630081] [2022-12-12 14:42:37,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186630081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:37,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:37,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:42:37,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712104169] [2022-12-12 14:42:37,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:37,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:42:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:37,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:42:37,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:42:37,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2022-12-12 14:42:37,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:37,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:37,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2022-12-12 14:42:37,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:38,787 INFO L130 PetriNetUnfolder]: 6079/9809 cut-off events. [2022-12-12 14:42:38,787 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-12 14:42:38,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18592 conditions, 9809 events. 6079/9809 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 72628 event pairs, 855 based on Foata normal form. 0/5894 useless extension candidates. Maximal degree in co-relation 18581. Up to 7305 conditions per place. [2022-12-12 14:42:38,810 INFO L137 encePairwiseOnDemand]: 50/54 looper letters, 28 selfloop transitions, 2 changer transitions 44/84 dead transitions. [2022-12-12 14:42:38,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 325 flow [2022-12-12 14:42:38,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:42:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:42:38,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-12-12 14:42:38,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2022-12-12 14:42:38,819 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 117 flow. Second operand 3 states and 107 transitions. [2022-12-12 14:42:38,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 325 flow [2022-12-12 14:42:38,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:42:38,823 INFO L231 Difference]: Finished difference. Result has 61 places, 30 transitions, 70 flow [2022-12-12 14:42:38,824 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=61, PETRI_TRANSITIONS=30} [2022-12-12 14:42:38,826 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2022-12-12 14:42:38,827 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 30 transitions, 70 flow [2022-12-12 14:42:38,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:38,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:38,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:38,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:42:38,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2057980510, now seen corresponding path program 1 times [2022-12-12 14:42:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:38,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631260085] [2022-12-12 14:42:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:39,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:39,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631260085] [2022-12-12 14:42:39,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631260085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:39,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:39,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:42:39,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000668436] [2022-12-12 14:42:39,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:39,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:42:39,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:39,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:42:39,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:42:39,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 14:42:39,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 30 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:39,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:39,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 14:42:39,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:39,635 INFO L130 PetriNetUnfolder]: 1896/2950 cut-off events. [2022-12-12 14:42:39,635 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-12 14:42:39,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5923 conditions, 2950 events. 1896/2950 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14988 event pairs, 437 based on Foata normal form. 42/2543 useless extension candidates. Maximal degree in co-relation 5913. Up to 2418 conditions per place. [2022-12-12 14:42:39,646 INFO L137 encePairwiseOnDemand]: 46/54 looper letters, 40 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2022-12-12 14:42:39,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 226 flow [2022-12-12 14:42:39,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:42:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:42:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-12 14:42:39,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36574074074074076 [2022-12-12 14:42:39,649 INFO L175 Difference]: Start difference. First operand has 61 places, 30 transitions, 70 flow. Second operand 4 states and 79 transitions. [2022-12-12 14:42:39,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 226 flow [2022-12-12 14:42:39,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:42:39,651 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 122 flow [2022-12-12 14:42:39,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-12 14:42:39,652 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -22 predicate places. [2022-12-12 14:42:39,652 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 122 flow [2022-12-12 14:42:39,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:39,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:39,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:39,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:42:39,653 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:39,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:39,655 INFO L85 PathProgramCache]: Analyzing trace with hash -627114415, now seen corresponding path program 1 times [2022-12-12 14:42:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:39,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662400422] [2022-12-12 14:42:39,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662400422] [2022-12-12 14:42:39,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662400422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:39,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:39,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:42:39,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528315431] [2022-12-12 14:42:39,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:39,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:42:39,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:39,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:42:39,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:42:39,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2022-12-12 14:42:39,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:39,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:39,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2022-12-12 14:42:39,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:40,225 INFO L130 PetriNetUnfolder]: 1658/2679 cut-off events. [2022-12-12 14:42:40,225 INFO L131 PetriNetUnfolder]: For 942/942 co-relation queries the response was YES. [2022-12-12 14:42:40,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6633 conditions, 2679 events. 1658/2679 cut-off events. For 942/942 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 14800 event pairs, 480 based on Foata normal form. 8/2186 useless extension candidates. Maximal degree in co-relation 6621. Up to 2181 conditions per place. [2022-12-12 14:42:40,238 INFO L137 encePairwiseOnDemand]: 50/54 looper letters, 33 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-12-12 14:42:40,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 221 flow [2022-12-12 14:42:40,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:42:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:42:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-12 14:42:40,241 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36419753086419754 [2022-12-12 14:42:40,242 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 122 flow. Second operand 3 states and 59 transitions. [2022-12-12 14:42:40,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 221 flow [2022-12-12 14:42:40,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 221 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-12 14:42:40,246 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 141 flow [2022-12-12 14:42:40,246 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-12 14:42:40,247 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -19 predicate places. [2022-12-12 14:42:40,247 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 141 flow [2022-12-12 14:42:40,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:40,250 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:40,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:40,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:42:40,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1652384143, now seen corresponding path program 1 times [2022-12-12 14:42:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:40,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683773962] [2022-12-12 14:42:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:40,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:40,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:40,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683773962] [2022-12-12 14:42:40,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683773962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:40,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:40,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:42:40,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982511935] [2022-12-12 14:42:40,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:40,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:42:40,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:40,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:42:40,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:42:40,651 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2022-12-12 14:42:40,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:40,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:40,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2022-12-12 14:42:40,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:40,911 INFO L130 PetriNetUnfolder]: 1606/2599 cut-off events. [2022-12-12 14:42:40,911 INFO L131 PetriNetUnfolder]: For 1395/1395 co-relation queries the response was YES. [2022-12-12 14:42:40,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6799 conditions, 2599 events. 1606/2599 cut-off events. For 1395/1395 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 14293 event pairs, 468 based on Foata normal form. 18/2122 useless extension candidates. Maximal degree in co-relation 6784. Up to 1986 conditions per place. [2022-12-12 14:42:40,925 INFO L137 encePairwiseOnDemand]: 49/54 looper letters, 42 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2022-12-12 14:42:40,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 304 flow [2022-12-12 14:42:40,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:42:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:42:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-12 14:42:40,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2022-12-12 14:42:40,929 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 141 flow. Second operand 4 states and 76 transitions. [2022-12-12 14:42:40,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 304 flow [2022-12-12 14:42:40,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:42:40,934 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 175 flow [2022-12-12 14:42:40,934 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2022-12-12 14:42:40,936 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -16 predicate places. [2022-12-12 14:42:40,936 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 175 flow [2022-12-12 14:42:40,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:40,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:40,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:40,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:42:40,936 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:40,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:40,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1462525034, now seen corresponding path program 1 times [2022-12-12 14:42:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:40,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816259727] [2022-12-12 14:42:40,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:40,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:41,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:41,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816259727] [2022-12-12 14:42:41,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816259727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:41,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:41,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:41,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329581635] [2022-12-12 14:42:41,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:41,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:42:41,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:41,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:42:41,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:42:41,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 14:42:41,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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 14:42:41,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:41,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 14:42:41,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:41,736 INFO L130 PetriNetUnfolder]: 2600/4125 cut-off events. [2022-12-12 14:42:41,736 INFO L131 PetriNetUnfolder]: For 3701/3701 co-relation queries the response was YES. [2022-12-12 14:42:41,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11490 conditions, 4125 events. 2600/4125 cut-off events. For 3701/3701 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 23434 event pairs, 420 based on Foata normal form. 81/3469 useless extension candidates. Maximal degree in co-relation 11473. Up to 1968 conditions per place. [2022-12-12 14:42:41,757 INFO L137 encePairwiseOnDemand]: 44/54 looper letters, 67 selfloop transitions, 26 changer transitions 10/110 dead transitions. [2022-12-12 14:42:41,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 110 transitions, 662 flow [2022-12-12 14:42:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:42:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:42:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-12-12 14:42:41,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3765432098765432 [2022-12-12 14:42:41,761 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 175 flow. Second operand 6 states and 122 transitions. [2022-12-12 14:42:41,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 110 transitions, 662 flow [2022-12-12 14:42:41,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 110 transitions, 634 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-12 14:42:41,765 INFO L231 Difference]: Finished difference. Result has 55 places, 61 transitions, 378 flow [2022-12-12 14:42:41,765 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=378, PETRI_PLACES=55, PETRI_TRANSITIONS=61} [2022-12-12 14:42:41,767 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -9 predicate places. [2022-12-12 14:42:41,767 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 61 transitions, 378 flow [2022-12-12 14:42:41,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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 14:42:41,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:41,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:41,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:42:41,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:41,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1401756272, now seen corresponding path program 1 times [2022-12-12 14:42:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:41,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504070547] [2022-12-12 14:42:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:41,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:42,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504070547] [2022-12-12 14:42:42,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504070547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:42,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:42,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:42:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141703215] [2022-12-12 14:42:42,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:42,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:42:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:42,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:42:42,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:42:42,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 14:42:42,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 61 transitions, 378 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:42,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:42,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 14:42:42,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:42,660 INFO L130 PetriNetUnfolder]: 2699/4325 cut-off events. [2022-12-12 14:42:42,660 INFO L131 PetriNetUnfolder]: For 6098/6098 co-relation queries the response was YES. [2022-12-12 14:42:42,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14054 conditions, 4325 events. 2699/4325 cut-off events. For 6098/6098 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24564 event pairs, 299 based on Foata normal form. 16/3571 useless extension candidates. Maximal degree in co-relation 14033. Up to 2901 conditions per place. [2022-12-12 14:42:42,680 INFO L137 encePairwiseOnDemand]: 44/54 looper letters, 59 selfloop transitions, 29 changer transitions 1/96 dead transitions. [2022-12-12 14:42:42,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 96 transitions, 709 flow [2022-12-12 14:42:42,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:42:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:42:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-12 14:42:42,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.362962962962963 [2022-12-12 14:42:42,681 INFO L175 Difference]: Start difference. First operand has 55 places, 61 transitions, 378 flow. Second operand 5 states and 98 transitions. [2022-12-12 14:42:42,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 96 transitions, 709 flow [2022-12-12 14:42:42,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 96 transitions, 709 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-12 14:42:42,691 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 489 flow [2022-12-12 14:42:42,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=489, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2022-12-12 14:42:42,691 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2022-12-12 14:42:42,691 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 489 flow [2022-12-12 14:42:42,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:42,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:42,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:42,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:42:42,692 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:42,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:42,692 INFO L85 PathProgramCache]: Analyzing trace with hash -838600060, now seen corresponding path program 2 times [2022-12-12 14:42:42,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:42,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900562677] [2022-12-12 14:42:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:42,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:42,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:42,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900562677] [2022-12-12 14:42:42,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900562677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:42,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:42,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:42:42,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264020736] [2022-12-12 14:42:42,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:42,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:42:42,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:42,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:42:42,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:42:42,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2022-12-12 14:42:42,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 65 transitions, 489 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:42,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:42,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2022-12-12 14:42:42,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:43,202 INFO L130 PetriNetUnfolder]: 2353/3941 cut-off events. [2022-12-12 14:42:43,202 INFO L131 PetriNetUnfolder]: For 7540/7576 co-relation queries the response was YES. [2022-12-12 14:42:43,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13840 conditions, 3941 events. 2353/3941 cut-off events. For 7540/7576 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 24186 event pairs, 431 based on Foata normal form. 5/3202 useless extension candidates. Maximal degree in co-relation 13815. Up to 2725 conditions per place. [2022-12-12 14:42:43,221 INFO L137 encePairwiseOnDemand]: 48/54 looper letters, 54 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2022-12-12 14:42:43,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 742 flow [2022-12-12 14:42:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:42:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:42:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-12 14:42:43,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-12 14:42:43,222 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 489 flow. Second operand 4 states and 78 transitions. [2022-12-12 14:42:43,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 742 flow [2022-12-12 14:42:43,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:42:43,233 INFO L231 Difference]: Finished difference. Result has 64 places, 70 transitions, 549 flow [2022-12-12 14:42:43,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=549, PETRI_PLACES=64, PETRI_TRANSITIONS=70} [2022-12-12 14:42:43,233 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2022-12-12 14:42:43,233 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 70 transitions, 549 flow [2022-12-12 14:42:43,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:43,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:43,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:43,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:42:43,234 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:43,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1401233829, now seen corresponding path program 1 times [2022-12-12 14:42:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:43,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255326321] [2022-12-12 14:42:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:43,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:43,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255326321] [2022-12-12 14:42:43,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255326321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:43,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:43,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:42:43,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458283483] [2022-12-12 14:42:43,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:43,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:42:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:43,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:42:43,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:42:43,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2022-12-12 14:42:43,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 70 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:43,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:43,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2022-12-12 14:42:43,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:43,703 INFO L130 PetriNetUnfolder]: 3277/5590 cut-off events. [2022-12-12 14:42:43,703 INFO L131 PetriNetUnfolder]: For 16199/16326 co-relation queries the response was YES. [2022-12-12 14:42:43,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18606 conditions, 5590 events. 3277/5590 cut-off events. For 16199/16326 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 37821 event pairs, 1517 based on Foata normal form. 150/4510 useless extension candidates. Maximal degree in co-relation 18578. Up to 2742 conditions per place. [2022-12-12 14:42:43,726 INFO L137 encePairwiseOnDemand]: 51/54 looper letters, 60 selfloop transitions, 8 changer transitions 0/83 dead transitions. [2022-12-12 14:42:43,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 740 flow [2022-12-12 14:42:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:42:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:42:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-12 14:42:43,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3765432098765432 [2022-12-12 14:42:43,728 INFO L175 Difference]: Start difference. First operand has 64 places, 70 transitions, 549 flow. Second operand 3 states and 61 transitions. [2022-12-12 14:42:43,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 740 flow [2022-12-12 14:42:43,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 724 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-12 14:42:43,739 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 559 flow [2022-12-12 14:42:43,739 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2022-12-12 14:42:43,739 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 2 predicate places. [2022-12-12 14:42:43,739 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 559 flow [2022-12-12 14:42:43,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:43,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:43,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:43,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:42:43,740 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:43,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:43,740 INFO L85 PathProgramCache]: Analyzing trace with hash -466849260, now seen corresponding path program 1 times [2022-12-12 14:42:43,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:43,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046803558] [2022-12-12 14:42:43,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:43,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:44,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:44,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046803558] [2022-12-12 14:42:44,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046803558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:44,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:44,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:44,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448430000] [2022-12-12 14:42:44,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:44,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:42:44,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:44,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:42:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:42:44,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 14:42:44,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:44,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:44,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 14:42:44,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:44,875 INFO L130 PetriNetUnfolder]: 3693/6023 cut-off events. [2022-12-12 14:42:44,875 INFO L131 PetriNetUnfolder]: For 15803/15803 co-relation queries the response was YES. [2022-12-12 14:42:44,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21015 conditions, 6023 events. 3693/6023 cut-off events. For 15803/15803 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 37277 event pairs, 911 based on Foata normal form. 4/4846 useless extension candidates. Maximal degree in co-relation 20986. Up to 4401 conditions per place. [2022-12-12 14:42:44,896 INFO L137 encePairwiseOnDemand]: 44/54 looper letters, 59 selfloop transitions, 40 changer transitions 7/113 dead transitions. [2022-12-12 14:42:44,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 113 transitions, 1011 flow [2022-12-12 14:42:44,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:42:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:42:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2022-12-12 14:42:44,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.328042328042328 [2022-12-12 14:42:44,898 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 559 flow. Second operand 7 states and 124 transitions. [2022-12-12 14:42:44,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 113 transitions, 1011 flow [2022-12-12 14:42:44,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 113 transitions, 999 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:42:44,917 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 748 flow [2022-12-12 14:42:44,917 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=748, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2022-12-12 14:42:44,918 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 9 predicate places. [2022-12-12 14:42:44,918 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 748 flow [2022-12-12 14:42:44,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:44,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:44,918 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:44,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:42:44,919 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash -529518534, now seen corresponding path program 2 times [2022-12-12 14:42:44,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:44,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242817431] [2022-12-12 14:42:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:45,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:45,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242817431] [2022-12-12 14:42:45,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242817431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:45,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:45,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501950410] [2022-12-12 14:42:45,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:45,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:42:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:45,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:42:45,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:42:45,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 14:42:45,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 748 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:45,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:45,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 14:42:45,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:46,227 INFO L130 PetriNetUnfolder]: 3633/5933 cut-off events. [2022-12-12 14:42:46,228 INFO L131 PetriNetUnfolder]: For 21521/21521 co-relation queries the response was YES. [2022-12-12 14:42:46,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23163 conditions, 5933 events. 3633/5933 cut-off events. For 21521/21521 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 36971 event pairs, 899 based on Foata normal form. 5/4774 useless extension candidates. Maximal degree in co-relation 23131. Up to 4627 conditions per place. [2022-12-12 14:42:46,247 INFO L137 encePairwiseOnDemand]: 46/54 looper letters, 80 selfloop transitions, 37 changer transitions 8/132 dead transitions. [2022-12-12 14:42:46,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 132 transitions, 1483 flow [2022-12-12 14:42:46,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:42:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:42:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2022-12-12 14:42:46,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3201058201058201 [2022-12-12 14:42:46,249 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 748 flow. Second operand 7 states and 121 transitions. [2022-12-12 14:42:46,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 132 transitions, 1483 flow [2022-12-12 14:42:46,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 132 transitions, 1435 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-12 14:42:46,272 INFO L231 Difference]: Finished difference. Result has 79 places, 89 transitions, 1007 flow [2022-12-12 14:42:46,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1007, PETRI_PLACES=79, PETRI_TRANSITIONS=89} [2022-12-12 14:42:46,272 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 15 predicate places. [2022-12-12 14:42:46,272 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 89 transitions, 1007 flow [2022-12-12 14:42:46,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:46,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:46,273 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:46,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:42:46,273 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:46,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:46,273 INFO L85 PathProgramCache]: Analyzing trace with hash -529479474, now seen corresponding path program 3 times [2022-12-12 14:42:46,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:46,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888567211] [2022-12-12 14:42:46,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:46,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:46,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:46,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888567211] [2022-12-12 14:42:46,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888567211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:46,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:46,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:46,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653211477] [2022-12-12 14:42:46,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:46,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:42:46,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:42:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:42:46,720 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2022-12-12 14:42:46,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 89 transitions, 1007 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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 14:42:46,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:46,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2022-12-12 14:42:46,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:47,283 INFO L130 PetriNetUnfolder]: 3580/6140 cut-off events. [2022-12-12 14:42:47,283 INFO L131 PetriNetUnfolder]: For 27901/28140 co-relation queries the response was YES. [2022-12-12 14:42:47,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25732 conditions, 6140 events. 3580/6140 cut-off events. For 27901/28140 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 42891 event pairs, 635 based on Foata normal form. 163/5102 useless extension candidates. Maximal degree in co-relation 25697. Up to 4046 conditions per place. [2022-12-12 14:42:47,310 INFO L137 encePairwiseOnDemand]: 47/54 looper letters, 79 selfloop transitions, 39 changer transitions 2/136 dead transitions. [2022-12-12 14:42:47,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 136 transitions, 1683 flow [2022-12-12 14:42:47,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:42:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:42:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-12 14:42:47,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2022-12-12 14:42:47,312 INFO L175 Difference]: Start difference. First operand has 79 places, 89 transitions, 1007 flow. Second operand 5 states and 96 transitions. [2022-12-12 14:42:47,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 136 transitions, 1683 flow [2022-12-12 14:42:47,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 136 transitions, 1641 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-12 14:42:47,348 INFO L231 Difference]: Finished difference. Result has 81 places, 108 transitions, 1362 flow [2022-12-12 14:42:47,349 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1362, PETRI_PLACES=81, PETRI_TRANSITIONS=108} [2022-12-12 14:42:47,349 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 17 predicate places. [2022-12-12 14:42:47,349 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 108 transitions, 1362 flow [2022-12-12 14:42:47,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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 14:42:47,349 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:47,349 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:47,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:42:47,350 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:47,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash -466812060, now seen corresponding path program 4 times [2022-12-12 14:42:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:47,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213088655] [2022-12-12 14:42:47,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:47,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:47,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213088655] [2022-12-12 14:42:47,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213088655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:47,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:47,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:47,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947328798] [2022-12-12 14:42:47,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:47,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:42:47,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:47,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:42:47,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:42:47,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 14:42:47,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 108 transitions, 1362 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:47,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:47,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 14:42:47,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:48,655 INFO L130 PetriNetUnfolder]: 4484/7238 cut-off events. [2022-12-12 14:42:48,655 INFO L131 PetriNetUnfolder]: For 37160/37160 co-relation queries the response was YES. [2022-12-12 14:42:48,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32991 conditions, 7238 events. 4484/7238 cut-off events. For 37160/37160 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 46254 event pairs, 892 based on Foata normal form. 20/5856 useless extension candidates. Maximal degree in co-relation 32954. Up to 4846 conditions per place. [2022-12-12 14:42:48,681 INFO L137 encePairwiseOnDemand]: 44/54 looper letters, 78 selfloop transitions, 62 changer transitions 3/150 dead transitions. [2022-12-12 14:42:48,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 150 transitions, 1969 flow [2022-12-12 14:42:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:42:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:42:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-12 14:42:48,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31790123456790126 [2022-12-12 14:42:48,683 INFO L175 Difference]: Start difference. First operand has 81 places, 108 transitions, 1362 flow. Second operand 6 states and 103 transitions. [2022-12-12 14:42:48,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 150 transitions, 1969 flow [2022-12-12 14:42:48,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 150 transitions, 1957 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-12 14:42:48,733 INFO L231 Difference]: Finished difference. Result has 88 places, 123 transitions, 1779 flow [2022-12-12 14:42:48,733 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1779, PETRI_PLACES=88, PETRI_TRANSITIONS=123} [2022-12-12 14:42:48,733 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 24 predicate places. [2022-12-12 14:42:48,734 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 123 transitions, 1779 flow [2022-12-12 14:42:48,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:48,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:48,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:48,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:42:48,734 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:48,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash -359614510, now seen corresponding path program 5 times [2022-12-12 14:42:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:48,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648080340] [2022-12-12 14:42:48,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:49,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:49,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648080340] [2022-12-12 14:42:49,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648080340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:49,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:49,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:49,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419860967] [2022-12-12 14:42:49,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:49,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:42:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:49,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:42:49,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:42:49,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 14:42:49,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 123 transitions, 1779 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:49,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:49,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 14:42:49,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:50,078 INFO L130 PetriNetUnfolder]: 4665/7572 cut-off events. [2022-12-12 14:42:50,079 INFO L131 PetriNetUnfolder]: For 50755/50755 co-relation queries the response was YES. [2022-12-12 14:42:50,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37857 conditions, 7572 events. 4665/7572 cut-off events. For 50755/50755 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 49339 event pairs, 825 based on Foata normal form. 5/6112 useless extension candidates. Maximal degree in co-relation 37816. Up to 4833 conditions per place. [2022-12-12 14:42:50,115 INFO L137 encePairwiseOnDemand]: 44/54 looper letters, 99 selfloop transitions, 83 changer transitions 7/196 dead transitions. [2022-12-12 14:42:50,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 196 transitions, 2913 flow [2022-12-12 14:42:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 14:42:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 14:42:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2022-12-12 14:42:50,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2022-12-12 14:42:50,117 INFO L175 Difference]: Start difference. First operand has 88 places, 123 transitions, 1779 flow. Second operand 8 states and 138 transitions. [2022-12-12 14:42:50,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 196 transitions, 2913 flow [2022-12-12 14:42:50,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 196 transitions, 2871 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-12 14:42:50,194 INFO L231 Difference]: Finished difference. Result has 96 places, 147 transitions, 2467 flow [2022-12-12 14:42:50,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1744, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2467, PETRI_PLACES=96, PETRI_TRANSITIONS=147} [2022-12-12 14:42:50,195 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 32 predicate places. [2022-12-12 14:42:50,196 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 147 transitions, 2467 flow [2022-12-12 14:42:50,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:50,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:50,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:50,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 14:42:50,204 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:50,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash -359572660, now seen corresponding path program 6 times [2022-12-12 14:42:50,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:50,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196929292] [2022-12-12 14:42:50,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:50,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:50,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:50,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196929292] [2022-12-12 14:42:50,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196929292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:50,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:50,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:50,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745039339] [2022-12-12 14:42:50,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:50,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:42:50,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:50,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:42:50,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:42:50,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2022-12-12 14:42:50,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 147 transitions, 2467 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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 14:42:50,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:50,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2022-12-12 14:42:50,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:51,350 INFO L130 PetriNetUnfolder]: 4150/7020 cut-off events. [2022-12-12 14:42:51,350 INFO L131 PetriNetUnfolder]: For 67173/67486 co-relation queries the response was YES. [2022-12-12 14:42:51,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39374 conditions, 7020 events. 4150/7020 cut-off events. For 67173/67486 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 49287 event pairs, 868 based on Foata normal form. 170/5802 useless extension candidates. Maximal degree in co-relation 39329. Up to 4040 conditions per place. [2022-12-12 14:42:51,392 INFO L137 encePairwiseOnDemand]: 48/54 looper letters, 96 selfloop transitions, 55 changer transitions 6/181 dead transitions. [2022-12-12 14:42:51,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 181 transitions, 3100 flow [2022-12-12 14:42:51,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:42:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:42:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-12 14:42:51,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2022-12-12 14:42:51,394 INFO L175 Difference]: Start difference. First operand has 96 places, 147 transitions, 2467 flow. Second operand 6 states and 105 transitions. [2022-12-12 14:42:51,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 181 transitions, 3100 flow [2022-12-12 14:42:51,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 181 transitions, 3047 flow, removed 26 selfloop flow, removed 1 redundant places. [2022-12-12 14:42:51,565 INFO L231 Difference]: Finished difference. Result has 101 places, 147 transitions, 2579 flow [2022-12-12 14:42:51,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2579, PETRI_PLACES=101, PETRI_TRANSITIONS=147} [2022-12-12 14:42:51,565 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 37 predicate places. [2022-12-12 14:42:51,565 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 147 transitions, 2579 flow [2022-12-12 14:42:51,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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 14:42:51,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:51,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:51,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 14:42:51,566 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash -488618374, now seen corresponding path program 1 times [2022-12-12 14:42:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:51,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329838510] [2022-12-12 14:42:51,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:51,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:51,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329838510] [2022-12-12 14:42:51,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329838510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:51,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:51,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:42:51,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629053460] [2022-12-12 14:42:51,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:51,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:42:51,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:51,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:42:51,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:42:51,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 14:42:51,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 147 transitions, 2579 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:51,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:51,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 14:42:51,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:52,446 INFO L130 PetriNetUnfolder]: 5362/8568 cut-off events. [2022-12-12 14:42:52,446 INFO L131 PetriNetUnfolder]: For 96200/97659 co-relation queries the response was YES. [2022-12-12 14:42:52,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44296 conditions, 8568 events. 5362/8568 cut-off events. For 96200/97659 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 59548 event pairs, 1559 based on Foata normal form. 937/6417 useless extension candidates. Maximal degree in co-relation 44249. Up to 7993 conditions per place. [2022-12-12 14:42:52,493 INFO L137 encePairwiseOnDemand]: 43/54 looper letters, 100 selfloop transitions, 10 changer transitions 32/162 dead transitions. [2022-12-12 14:42:52,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 162 transitions, 2925 flow [2022-12-12 14:42:52,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:42:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:42:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-12 14:42:52,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-12 14:42:52,494 INFO L175 Difference]: Start difference. First operand has 101 places, 147 transitions, 2579 flow. Second operand 3 states and 63 transitions. [2022-12-12 14:42:52,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 162 transitions, 2925 flow [2022-12-12 14:42:52,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 162 transitions, 2879 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-12 14:42:52,579 INFO L231 Difference]: Finished difference. Result has 102 places, 108 transitions, 1654 flow [2022-12-12 14:42:52,579 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1654, PETRI_PLACES=102, PETRI_TRANSITIONS=108} [2022-12-12 14:42:52,579 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 38 predicate places. [2022-12-12 14:42:52,579 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 108 transitions, 1654 flow [2022-12-12 14:42:52,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:52,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:52,580 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:52,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 14:42:52,580 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash 955851504, now seen corresponding path program 1 times [2022-12-12 14:42:52,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:52,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128973810] [2022-12-12 14:42:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:52,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:52,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:52,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128973810] [2022-12-12 14:42:52,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128973810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:52,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:52,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:42:52,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702894319] [2022-12-12 14:42:52,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:52,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:42:52,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:52,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:42:52,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:42:52,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 14:42:52,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 108 transitions, 1654 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:52,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:52,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 14:42:52,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:53,050 INFO L130 PetriNetUnfolder]: 2210/3944 cut-off events. [2022-12-12 14:42:53,050 INFO L131 PetriNetUnfolder]: For 39901/40282 co-relation queries the response was YES. [2022-12-12 14:42:53,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22521 conditions, 3944 events. 2210/3944 cut-off events. For 39901/40282 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 27715 event pairs, 279 based on Foata normal form. 490/2983 useless extension candidates. Maximal degree in co-relation 22473. Up to 3106 conditions per place. [2022-12-12 14:42:53,068 INFO L137 encePairwiseOnDemand]: 43/54 looper letters, 82 selfloop transitions, 19 changer transitions 24/142 dead transitions. [2022-12-12 14:42:53,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 142 transitions, 2327 flow [2022-12-12 14:42:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:42:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:42:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-12 14:42:53,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38425925925925924 [2022-12-12 14:42:53,069 INFO L175 Difference]: Start difference. First operand has 102 places, 108 transitions, 1654 flow. Second operand 4 states and 83 transitions. [2022-12-12 14:42:53,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 142 transitions, 2327 flow [2022-12-12 14:42:53,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 142 transitions, 2245 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-12 14:42:53,113 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 1245 flow [2022-12-12 14:42:53,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1245, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2022-12-12 14:42:53,113 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 36 predicate places. [2022-12-12 14:42:53,113 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 1245 flow [2022-12-12 14:42:53,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:53,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:53,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:53,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 14:42:53,114 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:53,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1123456335, now seen corresponding path program 1 times [2022-12-12 14:42:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:53,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034382571] [2022-12-12 14:42:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:53,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:53,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:53,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034382571] [2022-12-12 14:42:53,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034382571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:53,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:53,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:53,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416433036] [2022-12-12 14:42:53,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:53,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:42:53,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:53,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:42:53,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:42:53,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 14:42:53,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 1245 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:53,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:53,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 14:42:53,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:53,403 INFO L130 PetriNetUnfolder]: 882/1798 cut-off events. [2022-12-12 14:42:53,403 INFO L131 PetriNetUnfolder]: For 12034/12095 co-relation queries the response was YES. [2022-12-12 14:42:53,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10702 conditions, 1798 events. 882/1798 cut-off events. For 12034/12095 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 12337 event pairs, 16 based on Foata normal form. 254/1305 useless extension candidates. Maximal degree in co-relation 10655. Up to 1135 conditions per place. [2022-12-12 14:42:53,410 INFO L137 encePairwiseOnDemand]: 43/54 looper letters, 29 selfloop transitions, 28 changer transitions 60/123 dead transitions. [2022-12-12 14:42:53,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 123 transitions, 1933 flow [2022-12-12 14:42:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:42:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:42:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-12 14:42:53,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 14:42:53,411 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 1245 flow. Second operand 5 states and 90 transitions. [2022-12-12 14:42:53,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 123 transitions, 1933 flow [2022-12-12 14:42:53,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 123 transitions, 1801 flow, removed 32 selfloop flow, removed 7 redundant places. [2022-12-12 14:42:53,431 INFO L231 Difference]: Finished difference. Result has 98 places, 52 transitions, 485 flow [2022-12-12 14:42:53,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=485, PETRI_PLACES=98, PETRI_TRANSITIONS=52} [2022-12-12 14:42:53,431 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 34 predicate places. [2022-12-12 14:42:53,431 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 52 transitions, 485 flow [2022-12-12 14:42:53,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:53,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:53,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:53,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-12 14:42:53,432 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:53,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:53,432 INFO L85 PathProgramCache]: Analyzing trace with hash 87448980, now seen corresponding path program 1 times [2022-12-12 14:42:53,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:53,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023533381] [2022-12-12 14:42:53,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:53,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:53,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:53,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:53,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023533381] [2022-12-12 14:42:53,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023533381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:53,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:53,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:42:53,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401520180] [2022-12-12 14:42:53,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:53,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:42:53,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:53,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:42:53,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:42:53,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2022-12-12 14:42:53,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 52 transitions, 485 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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 14:42:53,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:53,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2022-12-12 14:42:53,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:53,949 INFO L130 PetriNetUnfolder]: 328/750 cut-off events. [2022-12-12 14:42:53,949 INFO L131 PetriNetUnfolder]: For 2626/2712 co-relation queries the response was YES. [2022-12-12 14:42:53,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3709 conditions, 750 events. 328/750 cut-off events. For 2626/2712 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4601 event pairs, 25 based on Foata normal form. 57/624 useless extension candidates. Maximal degree in co-relation 3666. Up to 457 conditions per place. [2022-12-12 14:42:53,952 INFO L137 encePairwiseOnDemand]: 48/54 looper letters, 39 selfloop transitions, 6 changer transitions 24/81 dead transitions. [2022-12-12 14:42:53,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 81 transitions, 843 flow [2022-12-12 14:42:53,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:42:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:42:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-12-12 14:42:53,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2839506172839506 [2022-12-12 14:42:53,953 INFO L175 Difference]: Start difference. First operand has 98 places, 52 transitions, 485 flow. Second operand 6 states and 92 transitions. [2022-12-12 14:42:53,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 81 transitions, 843 flow [2022-12-12 14:42:53,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 81 transitions, 572 flow, removed 46 selfloop flow, removed 35 redundant places. [2022-12-12 14:42:53,960 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 261 flow [2022-12-12 14:42:53,961 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2022-12-12 14:42:53,961 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2022-12-12 14:42:53,961 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 261 flow [2022-12-12 14:42:53,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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 14:42:53,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:53,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:53,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-12 14:42:53,961 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:53,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:53,962 INFO L85 PathProgramCache]: Analyzing trace with hash 483505585, now seen corresponding path program 1 times [2022-12-12 14:42:53,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:53,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525177295] [2022-12-12 14:42:53,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:42:54,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:42:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:42:54,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:42:54,057 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:42:54,058 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 14:42:54,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 14:42:54,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 14:42:54,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 14:42:54,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 14:42:54,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 14:42:54,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-12 14:42:54,062 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:54,066 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:42:54,066 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:42:54,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:42:54 BasicIcfg [2022-12-12 14:42:54,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:42:54,132 INFO L158 Benchmark]: Toolchain (without parser) took 25263.60ms. Allocated memory was 173.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 147.4MB in the beginning and 1.0GB in the end (delta: -866.9MB). Peak memory consumption was 503.6MB. Max. memory is 8.0GB. [2022-12-12 14:42:54,132 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 173.0MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:42:54,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.88ms. Allocated memory is still 173.0MB. Free memory was 146.9MB in the beginning and 121.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 14:42:54,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.61ms. Allocated memory is still 173.0MB. Free memory was 120.6MB in the beginning and 118.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:42:54,133 INFO L158 Benchmark]: Boogie Preprocessor took 41.26ms. Allocated memory is still 173.0MB. Free memory was 118.0MB in the beginning and 116.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:42:54,133 INFO L158 Benchmark]: RCFGBuilder took 587.50ms. Allocated memory is still 173.0MB. Free memory was 116.4MB in the beginning and 82.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-12 14:42:54,133 INFO L158 Benchmark]: TraceAbstraction took 24167.29ms. Allocated memory was 173.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 81.3MB in the beginning and 1.0GB in the end (delta: -932.9MB). Peak memory consumption was 437.6MB. Max. memory is 8.0GB. [2022-12-12 14:42:54,134 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 173.0MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 407.88ms. Allocated memory is still 173.0MB. Free memory was 146.9MB in the beginning and 121.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.61ms. Allocated memory is still 173.0MB. Free memory was 120.6MB in the beginning and 118.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.26ms. Allocated memory is still 173.0MB. Free memory was 118.0MB in the beginning and 116.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 587.50ms. Allocated memory is still 173.0MB. Free memory was 116.4MB in the beginning and 82.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 24167.29ms. Allocated memory was 173.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 81.3MB in the beginning and 1.0GB in the end (delta: -932.9MB). Peak memory consumption was 437.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 111 PlacesBefore, 64 PlacesAfterwards, 103 TransitionsBefore, 54 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3126, independent: 2966, independent conditional: 2966, independent unconditional: 0, dependent: 160, dependent conditional: 160, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3126, independent: 2966, independent conditional: 0, independent unconditional: 2966, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3126, independent: 2966, independent conditional: 0, independent unconditional: 2966, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3126, independent: 2966, independent conditional: 0, independent unconditional: 2966, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1741, independent: 1681, independent conditional: 0, independent unconditional: 1681, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1741, independent: 1648, independent conditional: 0, independent unconditional: 1648, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 300, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3126, independent: 1285, independent conditional: 0, independent unconditional: 1285, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 1741, unknown conditional: 0, unknown unconditional: 1741] , Statistics on independence cache: Total cache size (in pairs): 3036, Positive cache size: 2976, Positive conditional cache size: 0, Positive unconditional cache size: 2976, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, 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_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2516, ((void *)0), P0, ((void *)0))=-2, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2517, ((void *)0), P1, ((void *)0))=-1, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2518, ((void *)0), P2, ((void *)0))=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 579 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 579 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1476 IncrementalHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 47 mSDtfsCounter, 1476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2579occurred in iteration=14, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 2934 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 14:42:54,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...