/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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:26:26,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:26:26,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:26:26,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:26:26,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:26:26,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:26:26,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:26:26,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:26:26,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:26:26,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:26:26,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:26:26,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:26:26,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:26:26,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:26:26,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:26:26,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:26:26,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:26:26,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:26:26,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:26:26,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:26:26,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:26:26,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:26:26,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:26:26,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:26:26,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:26:26,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:26:26,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:26:26,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:26:26,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:26:26,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:26:26,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:26:26,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:26:26,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:26:26,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:26:26,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:26:26,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:26:26,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:26:26,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:26:26,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:26:26,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:26:26,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:26:26,370 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-05 20:26:26,394 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:26:26,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:26:26,395 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:26:26,395 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:26:26,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:26:26,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:26:26,396 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:26:26,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:26:26,396 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:26:26,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:26:26,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:26:26,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:26:26,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:26:26,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:26:26,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:26:26,397 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:26:26,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:26:26,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:26:26,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:26:26,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:26:26,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:26:26,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:26:26,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:26:26,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:26:26,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:26:26,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:26:26,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:26:26,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:26:26,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:26:26,407 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:26:26,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:26:26,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:26:26,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:26:26,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:26:26,673 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:26:26,673 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:26:26,674 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-05 20:26:27,644 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:26:27,881 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:26:27,882 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-05 20:26:27,896 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc351362d/9f5ec5f3f98c420ab48d636d2616b4fe/FLAG7f16d8d6c [2022-12-05 20:26:27,905 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc351362d/9f5ec5f3f98c420ab48d636d2616b4fe [2022-12-05 20:26:27,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:26:27,908 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:26:27,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:26:27,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:26:27,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:26:27,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:26:27" (1/1) ... [2022-12-05 20:26:27,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5962696a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:27, skipping insertion in model container [2022-12-05 20:26:27,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:26:27" (1/1) ... [2022-12-05 20:26:27,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:26:27,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:26:28,048 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-05 20:26:28,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:26:28,236 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:26:28,247 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-05 20:26:28,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:28,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:28,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:26:28,335 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:26:28,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28 WrapperNode [2022-12-05 20:26:28,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:26:28,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:26:28,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:26:28,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:26:28,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (1/1) ... [2022-12-05 20:26:28,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (1/1) ... [2022-12-05 20:26:28,387 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-05 20:26:28,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:26:28,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:26:28,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:26:28,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:26:28,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (1/1) ... [2022-12-05 20:26:28,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (1/1) ... [2022-12-05 20:26:28,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (1/1) ... [2022-12-05 20:26:28,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (1/1) ... [2022-12-05 20:26:28,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (1/1) ... [2022-12-05 20:26:28,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (1/1) ... [2022-12-05 20:26:28,419 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (1/1) ... [2022-12-05 20:26:28,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (1/1) ... [2022-12-05 20:26:28,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:26:28,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:26:28,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:26:28,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:26:28,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (1/1) ... [2022-12-05 20:26:28,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:26:28,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:26:28,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 20:26:28,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 20:26:28,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:26:28,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:26:28,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:26:28,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:26:28,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:26:28,526 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:26:28,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:26:28,526 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:26:28,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:26:28,526 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:26:28,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:26:28,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:26:28,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:26:28,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:26:28,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:26:28,528 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:26:28,671 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:26:28,673 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:26:28,886 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:26:29,155 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:26:29,155 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:26:29,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:26:29 BoogieIcfgContainer [2022-12-05 20:26:29,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:26:29,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:26:29,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:26:29,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:26:29,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:26:27" (1/3) ... [2022-12-05 20:26:29,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81f788b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:26:29, skipping insertion in model container [2022-12-05 20:26:29,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:28" (2/3) ... [2022-12-05 20:26:29,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81f788b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:26:29, skipping insertion in model container [2022-12-05 20:26:29,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:26:29" (3/3) ... [2022-12-05 20:26:29,163 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-05 20:26:29,177 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:26:29,178 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:26:29,178 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:26:29,233 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:26:29,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 20:26:29,346 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 20:26:29,346 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:26:29,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 20:26:29,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 20:26:29,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-05 20:26:29,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:26:29,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-05 20:26:29,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-05 20:26:29,417 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 20:26:29,417 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:26:29,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 20:26:29,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-05 20:26:29,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-05 20:26:33,647 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-05 20:26:33,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:26:33,662 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;@12e0696d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:26:33,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:26:33,664 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 20:26:33,664 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:26:33,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:33,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 20:26:33,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:33,669 INFO L85 PathProgramCache]: Analyzing trace with hash 466670, now seen corresponding path program 1 times [2022-12-05 20:26:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:33,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325638302] [2022-12-05 20:26:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:33,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:33,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325638302] [2022-12-05 20:26:33,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325638302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:33,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:33,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:26:33,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917711407] [2022-12-05 20:26:33,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:33,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:26:33,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:33,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:26:33,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:26:33,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-05 20:26:33,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:33,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:33,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-05 20:26:33,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:34,282 INFO L130 PetriNetUnfolder]: 882/1448 cut-off events. [2022-12-05 20:26:34,282 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 20:26:34,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 1448 events. 882/1448 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7911 event pairs, 138 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 2811. Up to 1078 conditions per place. [2022-12-05 20:26:34,290 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 29 selfloop transitions, 2 changer transitions 8/42 dead transitions. [2022-12-05 20:26:34,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 177 flow [2022-12-05 20:26:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:26:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:26:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-05 20:26:34,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-05 20:26:34,299 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 53 transitions. [2022-12-05 20:26:34,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 177 flow [2022-12-05 20:26:34,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:26:34,303 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 52 flow [2022-12-05 20:26:34,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-05 20:26:34,306 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-05 20:26:34,306 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 52 flow [2022-12-05 20:26:34,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:34,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:34,307 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:34,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:26:34,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:34,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash -679666322, now seen corresponding path program 1 times [2022-12-05 20:26:34,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:34,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903528832] [2022-12-05 20:26:34,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:34,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:34,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:34,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903528832] [2022-12-05 20:26:34,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903528832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:34,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:34,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:26:34,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568511325] [2022-12-05 20:26:34,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:34,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:26:34,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:34,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:26:34,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:26:34,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:26:34,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:34,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:34,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:26:34,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:34,986 INFO L130 PetriNetUnfolder]: 988/1487 cut-off events. [2022-12-05 20:26:34,986 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-05 20:26:34,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 1487 events. 988/1487 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6342 event pairs, 204 based on Foata normal form. 36/1518 useless extension candidates. Maximal degree in co-relation 3102. Up to 1101 conditions per place. [2022-12-05 20:26:34,993 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 30 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2022-12-05 20:26:34,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 166 flow [2022-12-05 20:26:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-05 20:26:34,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-05 20:26:34,996 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 52 flow. Second operand 4 states and 44 transitions. [2022-12-05 20:26:34,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 166 flow [2022-12-05 20:26:34,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:26:34,997 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 108 flow [2022-12-05 20:26:34,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-05 20:26:34,998 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-05 20:26:34,998 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 108 flow [2022-12-05 20:26:34,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:34,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:34,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:34,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:26:34,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:35,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:35,000 INFO L85 PathProgramCache]: Analyzing trace with hash 405181272, now seen corresponding path program 1 times [2022-12-05 20:26:35,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:35,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792291620] [2022-12-05 20:26:35,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:35,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:35,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792291620] [2022-12-05 20:26:35,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792291620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:35,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:35,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:26:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381410527] [2022-12-05 20:26:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:35,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:26:35,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:35,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:26:35,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:26:35,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:35,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:35,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:35,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:35,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:35,330 INFO L130 PetriNetUnfolder]: 747/1199 cut-off events. [2022-12-05 20:26:35,330 INFO L131 PetriNetUnfolder]: For 682/698 co-relation queries the response was YES. [2022-12-05 20:26:35,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3313 conditions, 1199 events. 747/1199 cut-off events. For 682/698 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5418 event pairs, 357 based on Foata normal form. 6/1203 useless extension candidates. Maximal degree in co-relation 3300. Up to 1078 conditions per place. [2022-12-05 20:26:35,336 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 34 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2022-12-05 20:26:35,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 230 flow [2022-12-05 20:26:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:26:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:26:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 20:26:35,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-05 20:26:35,339 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 108 flow. Second operand 3 states and 38 transitions. [2022-12-05 20:26:35,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 230 flow [2022-12-05 20:26:35,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:26:35,341 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 140 flow [2022-12-05 20:26:35,342 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-05 20:26:35,342 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2022-12-05 20:26:35,343 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 140 flow [2022-12-05 20:26:35,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:35,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:35,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:35,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:26:35,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:35,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash -323246530, now seen corresponding path program 1 times [2022-12-05 20:26:35,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:35,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700061317] [2022-12-05 20:26:35,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:35,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:35,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:35,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700061317] [2022-12-05 20:26:35,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700061317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:35,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:35,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:26:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280510880] [2022-12-05 20:26:35,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:35,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:26:35,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:35,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:26:35,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:26:35,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 20:26:35,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 140 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:35,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:35,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 20:26:35,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:36,093 INFO L130 PetriNetUnfolder]: 1561/2345 cut-off events. [2022-12-05 20:26:36,093 INFO L131 PetriNetUnfolder]: For 1909/1909 co-relation queries the response was YES. [2022-12-05 20:26:36,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6726 conditions, 2345 events. 1561/2345 cut-off events. For 1909/1909 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10778 event pairs, 348 based on Foata normal form. 92/2437 useless extension candidates. Maximal degree in co-relation 6711. Up to 973 conditions per place. [2022-12-05 20:26:36,103 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 39 selfloop transitions, 8 changer transitions 18/65 dead transitions. [2022-12-05 20:26:36,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 403 flow [2022-12-05 20:26:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:26:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:26:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-05 20:26:36,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2022-12-05 20:26:36,105 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 140 flow. Second operand 5 states and 54 transitions. [2022-12-05 20:26:36,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 403 flow [2022-12-05 20:26:36,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 65 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:26:36,111 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 146 flow [2022-12-05 20:26:36,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-05 20:26:36,112 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-05 20:26:36,112 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 146 flow [2022-12-05 20:26:36,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:36,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:36,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:36,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:26:36,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:36,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1840609153, now seen corresponding path program 1 times [2022-12-05 20:26:36,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:36,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365458166] [2022-12-05 20:26:36,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:36,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:36,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:36,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365458166] [2022-12-05 20:26:36,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365458166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:36,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:36,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:26:36,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988042630] [2022-12-05 20:26:36,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:36,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:26:36,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:36,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:26:36,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:26:36,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:36,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:36,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:36,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:36,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:36,593 INFO L130 PetriNetUnfolder]: 681/1071 cut-off events. [2022-12-05 20:26:36,593 INFO L131 PetriNetUnfolder]: For 1446/1470 co-relation queries the response was YES. [2022-12-05 20:26:36,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 1071 events. 681/1071 cut-off events. For 1446/1470 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4406 event pairs, 377 based on Foata normal form. 19/1086 useless extension candidates. Maximal degree in co-relation 3393. Up to 999 conditions per place. [2022-12-05 20:26:36,600 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 32 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2022-12-05 20:26:36,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 288 flow [2022-12-05 20:26:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-05 20:26:36,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-05 20:26:36,601 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 146 flow. Second operand 4 states and 44 transitions. [2022-12-05 20:26:36,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 288 flow [2022-12-05 20:26:36,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 260 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-05 20:26:36,607 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 177 flow [2022-12-05 20:26:36,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2022-12-05 20:26:36,608 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-05 20:26:36,608 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 177 flow [2022-12-05 20:26:36,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:36,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:36,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:36,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:26:36,609 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1292126046, now seen corresponding path program 1 times [2022-12-05 20:26:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:36,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690496740] [2022-12-05 20:26:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:37,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:37,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690496740] [2022-12-05 20:26:37,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690496740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:37,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:37,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:26:37,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029936936] [2022-12-05 20:26:37,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:37,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:26:37,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:37,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:26:37,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:26:37,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:37,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:37,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:37,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:37,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:37,276 INFO L130 PetriNetUnfolder]: 709/1105 cut-off events. [2022-12-05 20:26:37,276 INFO L131 PetriNetUnfolder]: For 1427/1461 co-relation queries the response was YES. [2022-12-05 20:26:37,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3602 conditions, 1105 events. 709/1105 cut-off events. For 1427/1461 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4606 event pairs, 202 based on Foata normal form. 24/1124 useless extension candidates. Maximal degree in co-relation 3584. Up to 982 conditions per place. [2022-12-05 20:26:37,283 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 46 selfloop transitions, 16 changer transitions 0/66 dead transitions. [2022-12-05 20:26:37,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 443 flow [2022-12-05 20:26:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:26:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:26:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-05 20:26:37,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2022-12-05 20:26:37,285 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 177 flow. Second operand 5 states and 58 transitions. [2022-12-05 20:26:37,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 443 flow [2022-12-05 20:26:37,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:26:37,289 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 298 flow [2022-12-05 20:26:37,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2022-12-05 20:26:37,289 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2022-12-05 20:26:37,289 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 298 flow [2022-12-05 20:26:37,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:37,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:37,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:37,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:26:37,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:37,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:37,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2076700087, now seen corresponding path program 1 times [2022-12-05 20:26:37,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:37,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093536607] [2022-12-05 20:26:37,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:37,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:37,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093536607] [2022-12-05 20:26:37,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093536607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:37,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:37,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:26:37,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611030633] [2022-12-05 20:26:37,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:37,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:26:37,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:26:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:26:37,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:37,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:37,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:37,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:37,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:37,856 INFO L130 PetriNetUnfolder]: 704/1106 cut-off events. [2022-12-05 20:26:37,856 INFO L131 PetriNetUnfolder]: For 2526/2572 co-relation queries the response was YES. [2022-12-05 20:26:37,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4185 conditions, 1106 events. 704/1106 cut-off events. For 2526/2572 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4576 event pairs, 279 based on Foata normal form. 23/1124 useless extension candidates. Maximal degree in co-relation 4163. Up to 994 conditions per place. [2022-12-05 20:26:37,864 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 48 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2022-12-05 20:26:37,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 470 flow [2022-12-05 20:26:37,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:37,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-05 20:26:37,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2022-12-05 20:26:37,866 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 298 flow. Second operand 4 states and 47 transitions. [2022-12-05 20:26:37,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 470 flow [2022-12-05 20:26:37,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 459 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 20:26:37,871 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 325 flow [2022-12-05 20:26:37,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2022-12-05 20:26:37,872 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2022-12-05 20:26:37,872 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 325 flow [2022-12-05 20:26:37,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:37,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:37,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:37,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:26:37,873 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:37,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:37,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2076771914, now seen corresponding path program 2 times [2022-12-05 20:26:37,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:37,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485701680] [2022-12-05 20:26:37,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:37,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:38,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:38,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485701680] [2022-12-05 20:26:38,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485701680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:38,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:38,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:26:38,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547505274] [2022-12-05 20:26:38,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:38,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:26:38,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:38,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:26:38,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:26:38,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:38,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:38,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:38,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:38,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:38,461 INFO L130 PetriNetUnfolder]: 750/1179 cut-off events. [2022-12-05 20:26:38,461 INFO L131 PetriNetUnfolder]: For 3138/3194 co-relation queries the response was YES. [2022-12-05 20:26:38,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4628 conditions, 1179 events. 750/1179 cut-off events. For 3138/3194 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5033 event pairs, 242 based on Foata normal form. 47/1222 useless extension candidates. Maximal degree in co-relation 4604. Up to 967 conditions per place. [2022-12-05 20:26:38,469 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 55 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2022-12-05 20:26:38,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 78 transitions, 629 flow [2022-12-05 20:26:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-05 20:26:38,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2022-12-05 20:26:38,470 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 325 flow. Second operand 4 states and 52 transitions. [2022-12-05 20:26:38,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 78 transitions, 629 flow [2022-12-05 20:26:38,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 609 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 20:26:38,475 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 472 flow [2022-12-05 20:26:38,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=472, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2022-12-05 20:26:38,476 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2022-12-05 20:26:38,476 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 472 flow [2022-12-05 20:26:38,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:38,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:38,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:38,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:26:38,476 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:38,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:38,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2076770953, now seen corresponding path program 1 times [2022-12-05 20:26:38,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:38,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360885687] [2022-12-05 20:26:38,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:38,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:38,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:38,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360885687] [2022-12-05 20:26:38,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360885687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:38,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:38,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:26:38,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667727942] [2022-12-05 20:26:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:38,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:26:38,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:38,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:26:38,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:26:38,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:38,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 472 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:38,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:38,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:38,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:38,766 INFO L130 PetriNetUnfolder]: 765/1209 cut-off events. [2022-12-05 20:26:38,766 INFO L131 PetriNetUnfolder]: For 4210/4263 co-relation queries the response was YES. [2022-12-05 20:26:38,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5255 conditions, 1209 events. 765/1209 cut-off events. For 4210/4263 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5171 event pairs, 293 based on Foata normal form. 30/1235 useless extension candidates. Maximal degree in co-relation 5230. Up to 983 conditions per place. [2022-12-05 20:26:38,774 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 63 selfloop transitions, 12 changer transitions 0/79 dead transitions. [2022-12-05 20:26:38,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 728 flow [2022-12-05 20:26:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 20:26:38,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-05 20:26:38,795 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 472 flow. Second operand 4 states and 48 transitions. [2022-12-05 20:26:38,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 728 flow [2022-12-05 20:26:38,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 697 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 20:26:38,802 INFO L231 Difference]: Finished difference. Result has 54 places, 64 transitions, 510 flow [2022-12-05 20:26:38,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=510, PETRI_PLACES=54, PETRI_TRANSITIONS=64} [2022-12-05 20:26:38,803 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2022-12-05 20:26:38,803 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 64 transitions, 510 flow [2022-12-05 20:26:38,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:38,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:38,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:38,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:26:38,803 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2076705853, now seen corresponding path program 2 times [2022-12-05 20:26:38,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:38,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390231840] [2022-12-05 20:26:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:38,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:38,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390231840] [2022-12-05 20:26:38,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390231840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:38,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:38,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:26:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713484428] [2022-12-05 20:26:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:38,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:26:38,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:38,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:26:38,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:26:38,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:38,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 64 transitions, 510 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:38,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:38,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:38,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:39,153 INFO L130 PetriNetUnfolder]: 765/1210 cut-off events. [2022-12-05 20:26:39,154 INFO L131 PetriNetUnfolder]: For 4909/4962 co-relation queries the response was YES. [2022-12-05 20:26:39,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5485 conditions, 1210 events. 765/1210 cut-off events. For 4909/4962 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5177 event pairs, 292 based on Foata normal form. 30/1236 useless extension candidates. Maximal degree in co-relation 5459. Up to 984 conditions per place. [2022-12-05 20:26:39,162 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 64 selfloop transitions, 14 changer transitions 0/82 dead transitions. [2022-12-05 20:26:39,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 778 flow [2022-12-05 20:26:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:39,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 20:26:39,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-05 20:26:39,164 INFO L175 Difference]: Start difference. First operand has 54 places, 64 transitions, 510 flow. Second operand 4 states and 48 transitions. [2022-12-05 20:26:39,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 778 flow [2022-12-05 20:26:39,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 749 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-05 20:26:39,172 INFO L231 Difference]: Finished difference. Result has 57 places, 67 transitions, 552 flow [2022-12-05 20:26:39,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=552, PETRI_PLACES=57, PETRI_TRANSITIONS=67} [2022-12-05 20:26:39,172 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2022-12-05 20:26:39,173 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 67 transitions, 552 flow [2022-12-05 20:26:39,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:39,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:39,173 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:39,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:26:39,173 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:39,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash -45777854, now seen corresponding path program 1 times [2022-12-05 20:26:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:39,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042288904] [2022-12-05 20:26:39,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:39,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:39,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:39,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042288904] [2022-12-05 20:26:39,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042288904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:39,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:39,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:26:39,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703095697] [2022-12-05 20:26:39,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:39,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:26:39,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:39,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:26:39,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:26:39,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:39,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 67 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:39,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:39,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:39,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:39,773 INFO L130 PetriNetUnfolder]: 755/1188 cut-off events. [2022-12-05 20:26:39,773 INFO L131 PetriNetUnfolder]: For 5853/5934 co-relation queries the response was YES. [2022-12-05 20:26:39,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5549 conditions, 1188 events. 755/1188 cut-off events. For 5853/5934 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5071 event pairs, 212 based on Foata normal form. 71/1255 useless extension candidates. Maximal degree in co-relation 5521. Up to 880 conditions per place. [2022-12-05 20:26:39,789 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 66 selfloop transitions, 19 changer transitions 0/89 dead transitions. [2022-12-05 20:26:39,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 834 flow [2022-12-05 20:26:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-05 20:26:39,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2022-12-05 20:26:39,791 INFO L175 Difference]: Start difference. First operand has 57 places, 67 transitions, 552 flow. Second operand 4 states and 52 transitions. [2022-12-05 20:26:39,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 834 flow [2022-12-05 20:26:39,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 811 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-05 20:26:39,799 INFO L231 Difference]: Finished difference. Result has 60 places, 70 transitions, 618 flow [2022-12-05 20:26:39,799 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=618, PETRI_PLACES=60, PETRI_TRANSITIONS=70} [2022-12-05 20:26:39,799 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2022-12-05 20:26:39,800 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 70 transitions, 618 flow [2022-12-05 20:26:39,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:39,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:39,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:39,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:26:39,800 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:39,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1400079904, now seen corresponding path program 1 times [2022-12-05 20:26:39,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:39,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587164685] [2022-12-05 20:26:39,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:39,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:40,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:40,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587164685] [2022-12-05 20:26:40,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587164685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:40,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:40,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:26:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540094261] [2022-12-05 20:26:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:40,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:26:40,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:40,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:26:40,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:26:40,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:40,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 70 transitions, 618 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:40,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:40,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:40,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:40,235 INFO L130 PetriNetUnfolder]: 841/1326 cut-off events. [2022-12-05 20:26:40,235 INFO L131 PetriNetUnfolder]: For 7965/8018 co-relation queries the response was YES. [2022-12-05 20:26:40,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6497 conditions, 1326 events. 841/1326 cut-off events. For 7965/8018 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5784 event pairs, 253 based on Foata normal form. 57/1374 useless extension candidates. Maximal degree in co-relation 6467. Up to 991 conditions per place. [2022-12-05 20:26:40,244 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 66 selfloop transitions, 32 changer transitions 0/102 dead transitions. [2022-12-05 20:26:40,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 1042 flow [2022-12-05 20:26:40,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:26:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:26:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-05 20:26:40,246 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35119047619047616 [2022-12-05 20:26:40,246 INFO L175 Difference]: Start difference. First operand has 60 places, 70 transitions, 618 flow. Second operand 6 states and 59 transitions. [2022-12-05 20:26:40,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 1042 flow [2022-12-05 20:26:40,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 1009 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-05 20:26:40,258 INFO L231 Difference]: Finished difference. Result has 64 places, 84 transitions, 831 flow [2022-12-05 20:26:40,258 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=831, PETRI_PLACES=64, PETRI_TRANSITIONS=84} [2022-12-05 20:26:40,259 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2022-12-05 20:26:40,259 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 84 transitions, 831 flow [2022-12-05 20:26:40,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:40,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:40,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:40,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:26:40,259 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:40,260 INFO L85 PathProgramCache]: Analyzing trace with hash -531720798, now seen corresponding path program 1 times [2022-12-05 20:26:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:40,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766529333] [2022-12-05 20:26:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:40,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:40,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:40,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766529333] [2022-12-05 20:26:40,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766529333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:40,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:40,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:26:40,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407712492] [2022-12-05 20:26:40,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:40,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:26:40,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:40,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:26:40,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:26:40,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:40,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 84 transitions, 831 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:40,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:40,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:40,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:40,758 INFO L130 PetriNetUnfolder]: 864/1363 cut-off events. [2022-12-05 20:26:40,758 INFO L131 PetriNetUnfolder]: For 8889/8957 co-relation queries the response was YES. [2022-12-05 20:26:40,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7186 conditions, 1363 events. 864/1363 cut-off events. For 8889/8957 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6019 event pairs, 270 based on Foata normal form. 42/1396 useless extension candidates. Maximal degree in co-relation 7155. Up to 1110 conditions per place. [2022-12-05 20:26:40,768 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 84 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2022-12-05 20:26:40,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 1167 flow [2022-12-05 20:26:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-05 20:26:40,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-05 20:26:40,769 INFO L175 Difference]: Start difference. First operand has 64 places, 84 transitions, 831 flow. Second operand 4 states and 49 transitions. [2022-12-05 20:26:40,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 1167 flow [2022-12-05 20:26:40,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 103 transitions, 1116 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-05 20:26:40,783 INFO L231 Difference]: Finished difference. Result has 65 places, 87 transitions, 863 flow [2022-12-05 20:26:40,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=863, PETRI_PLACES=65, PETRI_TRANSITIONS=87} [2022-12-05 20:26:40,783 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 28 predicate places. [2022-12-05 20:26:40,784 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 87 transitions, 863 flow [2022-12-05 20:26:40,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:40,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:40,784 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:40,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:26:40,784 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:40,784 INFO L85 PathProgramCache]: Analyzing trace with hash -44612595, now seen corresponding path program 1 times [2022-12-05 20:26:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:40,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599298019] [2022-12-05 20:26:40,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:40,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:41,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:41,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599298019] [2022-12-05 20:26:41,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599298019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:41,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:41,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:26:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155463171] [2022-12-05 20:26:41,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:41,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:26:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:41,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:26:41,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:26:41,103 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:41,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 87 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:41,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:41,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:41,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:41,354 INFO L130 PetriNetUnfolder]: 846/1337 cut-off events. [2022-12-05 20:26:41,354 INFO L131 PetriNetUnfolder]: For 9695/9763 co-relation queries the response was YES. [2022-12-05 20:26:41,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7094 conditions, 1337 events. 846/1337 cut-off events. For 9695/9763 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5883 event pairs, 281 based on Foata normal form. 44/1372 useless extension candidates. Maximal degree in co-relation 7062. Up to 1102 conditions per place. [2022-12-05 20:26:41,364 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 82 selfloop transitions, 15 changer transitions 0/101 dead transitions. [2022-12-05 20:26:41,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 1135 flow [2022-12-05 20:26:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-05 20:26:41,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2022-12-05 20:26:41,365 INFO L175 Difference]: Start difference. First operand has 65 places, 87 transitions, 863 flow. Second operand 4 states and 47 transitions. [2022-12-05 20:26:41,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 1135 flow [2022-12-05 20:26:41,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 1092 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-05 20:26:41,380 INFO L231 Difference]: Finished difference. Result has 67 places, 87 transitions, 865 flow [2022-12-05 20:26:41,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=865, PETRI_PLACES=67, PETRI_TRANSITIONS=87} [2022-12-05 20:26:41,380 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2022-12-05 20:26:41,380 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 87 transitions, 865 flow [2022-12-05 20:26:41,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:41,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:41,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:41,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:26:41,381 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:41,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1402163104, now seen corresponding path program 2 times [2022-12-05 20:26:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:41,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785207480] [2022-12-05 20:26:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:41,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:41,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785207480] [2022-12-05 20:26:41,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785207480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:41,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:41,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:26:41,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928246875] [2022-12-05 20:26:41,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:41,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:26:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:41,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:26:41,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:26:41,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:41,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 87 transitions, 865 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:41,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:41,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:41,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:41,909 INFO L130 PetriNetUnfolder]: 880/1392 cut-off events. [2022-12-05 20:26:41,909 INFO L131 PetriNetUnfolder]: For 10121/10189 co-relation queries the response was YES. [2022-12-05 20:26:41,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7433 conditions, 1392 events. 880/1392 cut-off events. For 10121/10189 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6239 event pairs, 282 based on Foata normal form. 42/1425 useless extension candidates. Maximal degree in co-relation 7400. Up to 1124 conditions per place. [2022-12-05 20:26:41,919 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 87 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2022-12-05 20:26:41,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 116 transitions, 1316 flow [2022-12-05 20:26:41,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:26:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:26:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-05 20:26:41,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-05 20:26:41,921 INFO L175 Difference]: Start difference. First operand has 67 places, 87 transitions, 865 flow. Second operand 5 states and 55 transitions. [2022-12-05 20:26:41,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 116 transitions, 1316 flow [2022-12-05 20:26:41,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 1280 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-05 20:26:41,936 INFO L231 Difference]: Finished difference. Result has 68 places, 98 transitions, 1044 flow [2022-12-05 20:26:41,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1044, PETRI_PLACES=68, PETRI_TRANSITIONS=98} [2022-12-05 20:26:41,937 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 31 predicate places. [2022-12-05 20:26:41,937 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 98 transitions, 1044 flow [2022-12-05 20:26:41,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:41,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:41,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:41,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 20:26:41,938 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash -46629548, now seen corresponding path program 3 times [2022-12-05 20:26:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:41,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742235530] [2022-12-05 20:26:41,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:41,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:42,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:42,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742235530] [2022-12-05 20:26:42,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742235530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:42,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:42,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:26:42,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387814500] [2022-12-05 20:26:42,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:42,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:26:42,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:42,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:26:42,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:26:42,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:26:42,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 98 transitions, 1044 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:42,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:42,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:26:42,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:42,868 INFO L130 PetriNetUnfolder]: 1057/1640 cut-off events. [2022-12-05 20:26:42,868 INFO L131 PetriNetUnfolder]: For 11610/11610 co-relation queries the response was YES. [2022-12-05 20:26:42,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8828 conditions, 1640 events. 1057/1640 cut-off events. For 11610/11610 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7244 event pairs, 259 based on Foata normal form. 9/1649 useless extension candidates. Maximal degree in co-relation 8795. Up to 1133 conditions per place. [2022-12-05 20:26:42,881 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 81 selfloop transitions, 66 changer transitions 0/148 dead transitions. [2022-12-05 20:26:42,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 148 transitions, 1708 flow [2022-12-05 20:26:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:26:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:26:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-05 20:26:42,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2022-12-05 20:26:42,885 INFO L175 Difference]: Start difference. First operand has 68 places, 98 transitions, 1044 flow. Second operand 6 states and 68 transitions. [2022-12-05 20:26:42,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 148 transitions, 1708 flow [2022-12-05 20:26:42,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 148 transitions, 1620 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-12-05 20:26:42,907 INFO L231 Difference]: Finished difference. Result has 72 places, 118 transitions, 1426 flow [2022-12-05 20:26:42,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1426, PETRI_PLACES=72, PETRI_TRANSITIONS=118} [2022-12-05 20:26:42,908 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 35 predicate places. [2022-12-05 20:26:42,908 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 118 transitions, 1426 flow [2022-12-05 20:26:42,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:42,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:42,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:42,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 20:26:42,908 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:42,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:42,909 INFO L85 PathProgramCache]: Analyzing trace with hash 987275313, now seen corresponding path program 1 times [2022-12-05 20:26:42,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:42,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459330226] [2022-12-05 20:26:42,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:42,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:43,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:43,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459330226] [2022-12-05 20:26:43,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459330226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:43,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:43,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:26:43,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301295334] [2022-12-05 20:26:43,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:43,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:26:43,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:43,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:26:43,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:26:43,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-05 20:26:43,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 118 transitions, 1426 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:43,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:43,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-05 20:26:43,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:43,155 INFO L130 PetriNetUnfolder]: 499/848 cut-off events. [2022-12-05 20:26:43,155 INFO L131 PetriNetUnfolder]: For 10278/10379 co-relation queries the response was YES. [2022-12-05 20:26:43,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5356 conditions, 848 events. 499/848 cut-off events. For 10278/10379 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3856 event pairs, 88 based on Foata normal form. 99/939 useless extension candidates. Maximal degree in co-relation 5321. Up to 611 conditions per place. [2022-12-05 20:26:43,160 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 114 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2022-12-05 20:26:43,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 129 transitions, 1787 flow [2022-12-05 20:26:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:26:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:26:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-05 20:26:43,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2022-12-05 20:26:43,162 INFO L175 Difference]: Start difference. First operand has 72 places, 118 transitions, 1426 flow. Second operand 3 states and 41 transitions. [2022-12-05 20:26:43,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 129 transitions, 1787 flow [2022-12-05 20:26:43,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 129 transitions, 1700 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-05 20:26:43,173 INFO L231 Difference]: Finished difference. Result has 71 places, 94 transitions, 1060 flow [2022-12-05 20:26:43,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=71, PETRI_TRANSITIONS=94} [2022-12-05 20:26:43,174 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2022-12-05 20:26:43,174 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 94 transitions, 1060 flow [2022-12-05 20:26:43,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:43,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:43,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:43,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 20:26:43,174 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:43,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1301846596, now seen corresponding path program 1 times [2022-12-05 20:26:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:43,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065023605] [2022-12-05 20:26:43,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:43,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:43,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065023605] [2022-12-05 20:26:43,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065023605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:43,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:43,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:26:43,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960376173] [2022-12-05 20:26:43,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:43,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:26:43,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:43,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:26:43,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:26:43,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-05 20:26:43,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 94 transitions, 1060 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:43,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:43,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-05 20:26:43,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:43,369 INFO L130 PetriNetUnfolder]: 255/474 cut-off events. [2022-12-05 20:26:43,369 INFO L131 PetriNetUnfolder]: For 4390/4416 co-relation queries the response was YES. [2022-12-05 20:26:43,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2926 conditions, 474 events. 255/474 cut-off events. For 4390/4416 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1988 event pairs, 35 based on Foata normal form. 61/529 useless extension candidates. Maximal degree in co-relation 2890. Up to 194 conditions per place. [2022-12-05 20:26:43,374 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 112 selfloop transitions, 7 changer transitions 0/130 dead transitions. [2022-12-05 20:26:43,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 130 transitions, 1727 flow [2022-12-05 20:26:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:26:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:26:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-05 20:26:43,375 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-05 20:26:43,375 INFO L175 Difference]: Start difference. First operand has 71 places, 94 transitions, 1060 flow. Second operand 4 states and 54 transitions. [2022-12-05 20:26:43,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 130 transitions, 1727 flow [2022-12-05 20:26:43,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 130 transitions, 1647 flow, removed 31 selfloop flow, removed 3 redundant places. [2022-12-05 20:26:43,382 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 937 flow [2022-12-05 20:26:43,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=937, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2022-12-05 20:26:43,382 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 35 predicate places. [2022-12-05 20:26:43,382 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 937 flow [2022-12-05 20:26:43,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:43,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:43,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:43,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 20:26:43,383 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:43,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:43,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1813726985, now seen corresponding path program 1 times [2022-12-05 20:26:43,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:43,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882127884] [2022-12-05 20:26:43,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:43,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:26:43,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:43,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882127884] [2022-12-05 20:26:43,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882127884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:43,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:43,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:26:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502652686] [2022-12-05 20:26:43,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:43,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:26:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:43,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:26:43,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:26:43,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-05 20:26:43,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 937 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:43,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:43,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-05 20:26:43,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:43,577 INFO L130 PetriNetUnfolder]: 222/406 cut-off events. [2022-12-05 20:26:43,577 INFO L131 PetriNetUnfolder]: For 3287/3309 co-relation queries the response was YES. [2022-12-05 20:26:43,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 406 events. 222/406 cut-off events. For 3287/3309 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1693 event pairs, 32 based on Foata normal form. 27/427 useless extension candidates. Maximal degree in co-relation 2365. Up to 168 conditions per place. [2022-12-05 20:26:43,580 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 105 selfloop transitions, 10 changer transitions 0/126 dead transitions. [2022-12-05 20:26:43,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 126 transitions, 1625 flow [2022-12-05 20:26:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:26:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:26:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-05 20:26:43,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2022-12-05 20:26:43,581 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 937 flow. Second operand 5 states and 57 transitions. [2022-12-05 20:26:43,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 126 transitions, 1625 flow [2022-12-05 20:26:43,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 126 transitions, 1555 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-12-05 20:26:43,588 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 862 flow [2022-12-05 20:26:43,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=862, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2022-12-05 20:26:43,588 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 36 predicate places. [2022-12-05 20:26:43,589 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 862 flow [2022-12-05 20:26:43,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:43,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:43,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:43,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 20:26:43,589 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:43,589 INFO L85 PathProgramCache]: Analyzing trace with hash 835655102, now seen corresponding path program 1 times [2022-12-05 20:26:43,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:43,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534712496] [2022-12-05 20:26:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:43,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:26: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-05 20:26:44,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:26:44,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534712496] [2022-12-05 20:26:44,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534712496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:26:44,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:26:44,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:26:44,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064335622] [2022-12-05 20:26:44,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:26:44,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:26:44,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:26:44,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:26:44,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:26:44,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:26:44,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 862 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:44,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:26:44,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:26:44,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:26:44,521 INFO L130 PetriNetUnfolder]: 296/575 cut-off events. [2022-12-05 20:26:44,521 INFO L131 PetriNetUnfolder]: For 4103/4127 co-relation queries the response was YES. [2022-12-05 20:26:44,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3294 conditions, 575 events. 296/575 cut-off events. For 4103/4127 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2644 event pairs, 40 based on Foata normal form. 16/587 useless extension candidates. Maximal degree in co-relation 3258. Up to 194 conditions per place. [2022-12-05 20:26:44,525 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 80 selfloop transitions, 28 changer transitions 32/145 dead transitions. [2022-12-05 20:26:44,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 145 transitions, 1652 flow [2022-12-05 20:26:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:26:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:26:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-12-05 20:26:44,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3794642857142857 [2022-12-05 20:26:44,526 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 862 flow. Second operand 8 states and 85 transitions. [2022-12-05 20:26:44,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 145 transitions, 1652 flow [2022-12-05 20:26:44,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 145 transitions, 1547 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-05 20:26:44,535 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 897 flow [2022-12-05 20:26:44,535 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=897, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2022-12-05 20:26:44,535 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 43 predicate places. [2022-12-05 20:26:44,535 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 897 flow [2022-12-05 20:26:44,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:26:44,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:26:44,536 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:44,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-05 20:26:44,536 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:26:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:26:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1505479048, now seen corresponding path program 2 times [2022-12-05 20:26:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:26:44,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308255211] [2022-12-05 20:26:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:26:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:26:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:26:44,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:26:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:26:44,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:26:44,621 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:26:44,622 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:26:44,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:26:44,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:26:44,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:26:44,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:26:44,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:26:44,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-05 20:26:44,624 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:26:44,629 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:26:44,630 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:26:44,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:26:44 BasicIcfg [2022-12-05 20:26:44,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:26:44,693 INFO L158 Benchmark]: Toolchain (without parser) took 16785.32ms. Allocated memory was 179.3MB in the beginning and 664.8MB in the end (delta: 485.5MB). Free memory was 153.2MB in the beginning and 285.6MB in the end (delta: -132.3MB). Peak memory consumption was 354.7MB. Max. memory is 8.0GB. [2022-12-05 20:26:44,694 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:26:44,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.99ms. Allocated memory is still 179.3MB. Free memory was 153.2MB in the beginning and 127.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 20:26:44,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.33ms. Allocated memory is still 179.3MB. Free memory was 127.0MB in the beginning and 124.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:26:44,694 INFO L158 Benchmark]: Boogie Preprocessor took 54.22ms. Allocated memory is still 179.3MB. Free memory was 124.4MB in the beginning and 122.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:26:44,694 INFO L158 Benchmark]: RCFGBuilder took 714.05ms. Allocated memory is still 179.3MB. Free memory was 122.3MB in the beginning and 86.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-05 20:26:44,694 INFO L158 Benchmark]: TraceAbstraction took 15534.65ms. Allocated memory was 179.3MB in the beginning and 664.8MB in the end (delta: 485.5MB). Free memory was 86.1MB in the beginning and 285.6MB in the end (delta: -199.4MB). Peak memory consumption was 287.6MB. Max. memory is 8.0GB. [2022-12-05 20:26:44,695 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 426.99ms. Allocated memory is still 179.3MB. Free memory was 153.2MB in the beginning and 127.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.33ms. Allocated memory is still 179.3MB. Free memory was 127.0MB in the beginning and 124.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.22ms. Allocated memory is still 179.3MB. Free memory was 124.4MB in the beginning and 122.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 714.05ms. Allocated memory is still 179.3MB. Free memory was 122.3MB in the beginning and 86.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 15534.65ms. Allocated memory was 179.3MB in the beginning and 664.8MB in the end (delta: 485.5MB). Free memory was 86.1MB in the beginning and 285.6MB in the end (delta: -199.4MB). Peak memory consumption was 287.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 112 PlacesBefore, 37 PlacesAfterwards, 104 TransitionsBefore, 28 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1521, independent: 1465, independent conditional: 1465, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1521, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1521, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1521, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1165, independent: 1130, independent conditional: 0, independent unconditional: 1130, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1165, independent: 1112, independent conditional: 0, independent unconditional: 1112, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 211, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1521, independent: 335, independent conditional: 0, independent unconditional: 335, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1165, unknown conditional: 0, unknown unconditional: 1165] , Statistics on independence cache: Total cache size (in pairs): 1758, Positive cache size: 1723, Positive conditional cache size: 0, Positive unconditional cache size: 1723, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-2, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=-1, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.3s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 438 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1472 IncrementalHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 24 mSDtfsCounter, 1472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1426occurred in iteration=16, 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, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 3122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:26:44,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...