/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:39:08,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:39:08,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:39:08,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:39:08,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:39:08,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:39:08,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:39:08,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:39:08,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:39:08,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:39:08,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:39:08,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:39:08,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:39:08,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:39:08,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:39:08,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:39:08,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:39:08,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:39:08,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:39:08,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:39:08,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:39:08,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:39:08,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:39:08,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:39:08,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:39:08,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:39:08,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:39:08,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:39:08,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:39:08,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:39:08,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:39:08,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:39:08,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:39:08,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:39:08,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:39:08,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:39:08,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:39:08,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:39:08,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:39:08,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:39:08,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:39:08,479 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 18:39:08,503 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:39:08,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:39:08,505 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:39:08,505 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:39:08,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:39:08,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:39:08,506 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:39:08,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:39:08,506 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:39:08,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:39:08,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:39:08,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:39:08,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:39:08,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:39:08,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:39:08,507 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:39:08,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:39:08,508 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:39:08,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:39:08,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:39:08,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:39:08,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:39:08,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:39:08,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:39:08,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:39:08,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:39:08,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:39:08,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:39:08,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:39:08,509 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:39:08,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 18:39:08,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:39:08,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:39:08,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:39:08,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:39:08,812 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:39:08,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2022-12-12 18:39:09,773 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:39:10,015 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:39:10,015 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2022-12-12 18:39:10,030 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f9ec72fd/4133139d5aee44f398659603b703b1af/FLAG0e9fac283 [2022-12-12 18:39:10,042 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f9ec72fd/4133139d5aee44f398659603b703b1af [2022-12-12 18:39:10,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:39:10,045 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:39:10,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:39:10,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:39:10,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:39:10,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63881c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10, skipping insertion in model container [2022-12-12 18:39:10,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:39:10,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:39:10,198 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/mix052_tso.oepc.i[949,962] [2022-12-12 18:39:10,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:39:10,400 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:39:10,410 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/mix052_tso.oepc.i[949,962] [2022-12-12 18:39:10,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:10,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:10,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:39:10,497 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:39:10,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10 WrapperNode [2022-12-12 18:39:10,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:39:10,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:39:10,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:39:10,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:39:10,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,549 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-12 18:39:10,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:39:10,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:39:10,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:39:10,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:39:10,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,578 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:39:10,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:39:10,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:39:10,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:39:10,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (1/1) ... [2022-12-12 18:39:10,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:39:10,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:39:10,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 18:39:10,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 18:39:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:39:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:39:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:39:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:39:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:39:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:39:10,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:39:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:39:10,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:39:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:39:10,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:39:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:39:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:39:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:39:10,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:39:10,655 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:39:10,761 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:39:10,762 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:39:11,013 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:39:11,146 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:39:11,146 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:39:11,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:39:11 BoogieIcfgContainer [2022-12-12 18:39:11,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:39:11,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:39:11,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:39:11,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:39:11,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:39:10" (1/3) ... [2022-12-12 18:39:11,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5724b9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:39:11, skipping insertion in model container [2022-12-12 18:39:11,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:10" (2/3) ... [2022-12-12 18:39:11,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5724b9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:39:11, skipping insertion in model container [2022-12-12 18:39:11,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:39:11" (3/3) ... [2022-12-12 18:39:11,159 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2022-12-12 18:39:11,174 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:39:11,174 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:39:11,174 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:39:11,234 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:39:11,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-12 18:39:11,313 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-12 18:39:11,313 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:39:11,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 18:39:11,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-12 18:39:11,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-12 18:39:11,325 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:39:11,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-12 18:39:11,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-12 18:39:11,366 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-12 18:39:11,366 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:39:11,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 18:39:11,373 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-12 18:39:11,373 INFO L226 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-12 18:39:19,023 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-12 18:39:19,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:39:19,047 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;@6b8de3fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:39:19,048 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 18:39:19,051 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-12 18:39:19,051 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:39:19,051 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:19,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 18:39:19,053 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:19,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash 467978769, now seen corresponding path program 1 times [2022-12-12 18:39:19,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:19,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471976208] [2022-12-12 18:39:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:19,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:19,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:19,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471976208] [2022-12-12 18:39:19,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471976208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:19,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:19,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:39:19,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958333538] [2022-12-12 18:39:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:19,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:19,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:19,421 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 60 [2022-12-12 18:39:19,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:19,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:19,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 60 [2022-12-12 18:39:19,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:20,699 INFO L130 PetriNetUnfolder]: 7924/12462 cut-off events. [2022-12-12 18:39:20,699 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-12 18:39:20,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23864 conditions, 12462 events. 7924/12462 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 87856 event pairs, 2218 based on Foata normal form. 0/7559 useless extension candidates. Maximal degree in co-relation 23853. Up to 9597 conditions per place. [2022-12-12 18:39:20,735 INFO L137 encePairwiseOnDemand]: 56/60 looper letters, 32 selfloop transitions, 2 changer transitions 52/97 dead transitions. [2022-12-12 18:39:20,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 378 flow [2022-12-12 18:39:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-12-12 18:39:20,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-12 18:39:20,747 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 0 predicate places. [2022-12-12 18:39:20,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 97 transitions, 378 flow [2022-12-12 18:39:20,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 45 transitions, 170 flow [2022-12-12 18:39:20,766 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 170 flow [2022-12-12 18:39:20,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:20,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:20,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:20,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:39:20,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:20,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:20,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1423142085, now seen corresponding path program 1 times [2022-12-12 18:39:20,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:20,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634338488] [2022-12-12 18:39:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:20,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:21,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:21,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634338488] [2022-12-12 18:39:21,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634338488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:21,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:21,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:39:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729098060] [2022-12-12 18:39:21,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:21,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:39:21,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:21,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:39:21,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:39:21,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 18:39:21,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:21,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:21,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 18:39:21,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:21,501 INFO L130 PetriNetUnfolder]: 1391/2290 cut-off events. [2022-12-12 18:39:21,501 INFO L131 PetriNetUnfolder]: For 188/202 co-relation queries the response was YES. [2022-12-12 18:39:21,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6371 conditions, 2290 events. 1391/2290 cut-off events. For 188/202 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12734 event pairs, 139 based on Foata normal form. 13/1939 useless extension candidates. Maximal degree in co-relation 6357. Up to 1982 conditions per place. [2022-12-12 18:39:21,514 INFO L137 encePairwiseOnDemand]: 56/60 looper letters, 44 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-12-12 18:39:21,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 316 flow [2022-12-12 18:39:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-12 18:39:21,518 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-12 18:39:21,519 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -24 predicate places. [2022-12-12 18:39:21,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 57 transitions, 316 flow [2022-12-12 18:39:21,529 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 57 transitions, 316 flow [2022-12-12 18:39:21,529 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 57 transitions, 316 flow [2022-12-12 18:39:21,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:21,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:21,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:21,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:39:21,530 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:21,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1167730840, now seen corresponding path program 1 times [2022-12-12 18:39:21,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:21,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764538452] [2022-12-12 18:39:21,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:22,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:22,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764538452] [2022-12-12 18:39:22,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764538452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:22,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:22,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:39:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189248471] [2022-12-12 18:39:22,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:22,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:22,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:22,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:22,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:22,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 18:39:22,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 57 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:22,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:22,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 18:39:22,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:22,527 INFO L130 PetriNetUnfolder]: 1399/2275 cut-off events. [2022-12-12 18:39:22,527 INFO L131 PetriNetUnfolder]: For 338/390 co-relation queries the response was YES. [2022-12-12 18:39:22,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8451 conditions, 2275 events. 1399/2275 cut-off events. For 338/390 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12131 event pairs, 241 based on Foata normal form. 26/1937 useless extension candidates. Maximal degree in co-relation 8434. Up to 1994 conditions per place. [2022-12-12 18:39:22,542 INFO L137 encePairwiseOnDemand]: 53/60 looper letters, 59 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2022-12-12 18:39:22,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 588 flow [2022-12-12 18:39:22,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:39:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:39:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-12 18:39:22,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34 [2022-12-12 18:39:22,547 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -20 predicate places. [2022-12-12 18:39:22,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 79 transitions, 588 flow [2022-12-12 18:39:22,559 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 79 transitions, 588 flow [2022-12-12 18:39:22,560 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 79 transitions, 588 flow [2022-12-12 18:39:22,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:22,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:22,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:22,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:39:22,560 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:22,561 INFO L85 PathProgramCache]: Analyzing trace with hash 51142076, now seen corresponding path program 1 times [2022-12-12 18:39:22,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:22,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179347982] [2022-12-12 18:39:22,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:22,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:22,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:22,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179347982] [2022-12-12 18:39:22,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179347982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:22,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:22,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:39:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106177434] [2022-12-12 18:39:22,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:22,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:39:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:22,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:39:22,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:39:22,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 18:39:22,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 79 transitions, 588 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:22,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:22,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 18:39:22,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:23,183 INFO L130 PetriNetUnfolder]: 2143/3317 cut-off events. [2022-12-12 18:39:23,184 INFO L131 PetriNetUnfolder]: For 2557/2557 co-relation queries the response was YES. [2022-12-12 18:39:23,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14886 conditions, 3317 events. 2143/3317 cut-off events. For 2557/2557 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16709 event pairs, 550 based on Foata normal form. 24/2863 useless extension candidates. Maximal degree in co-relation 14866. Up to 2750 conditions per place. [2022-12-12 18:39:23,206 INFO L137 encePairwiseOnDemand]: 55/60 looper letters, 77 selfloop transitions, 9 changer transitions 0/94 dead transitions. [2022-12-12 18:39:23,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 94 transitions, 872 flow [2022-12-12 18:39:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:39:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:39:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-12 18:39:23,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3458333333333333 [2022-12-12 18:39:23,208 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2022-12-12 18:39:23,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 94 transitions, 872 flow [2022-12-12 18:39:23,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 94 transitions, 872 flow [2022-12-12 18:39:23,225 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 94 transitions, 872 flow [2022-12-12 18:39:23,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:23,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:23,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:23,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:39:23,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:23,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1585405191, now seen corresponding path program 1 times [2022-12-12 18:39:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:23,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463602321] [2022-12-12 18:39:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:23,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:23,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463602321] [2022-12-12 18:39:23,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463602321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:23,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:23,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:39:23,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269120649] [2022-12-12 18:39:23,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:23,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:39:23,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:23,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:39:23,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:39:23,612 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 18:39:23,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 94 transitions, 872 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:23,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:23,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 18:39:23,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:23,981 INFO L130 PetriNetUnfolder]: 2227/3474 cut-off events. [2022-12-12 18:39:23,981 INFO L131 PetriNetUnfolder]: For 4045/4045 co-relation queries the response was YES. [2022-12-12 18:39:23,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18418 conditions, 3474 events. 2227/3474 cut-off events. For 4045/4045 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18111 event pairs, 537 based on Foata normal form. 12/2999 useless extension candidates. Maximal degree in co-relation 18395. Up to 2856 conditions per place. [2022-12-12 18:39:24,001 INFO L137 encePairwiseOnDemand]: 52/60 looper letters, 89 selfloop transitions, 22 changer transitions 0/122 dead transitions. [2022-12-12 18:39:24,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 122 transitions, 1383 flow [2022-12-12 18:39:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:39:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:39:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-12 18:39:24,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-12 18:39:24,005 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -13 predicate places. [2022-12-12 18:39:24,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 122 transitions, 1383 flow [2022-12-12 18:39:24,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 122 transitions, 1383 flow [2022-12-12 18:39:24,023 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 122 transitions, 1383 flow [2022-12-12 18:39:24,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:24,032 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:24,032 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:24,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:39:24,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:24,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1582183671, now seen corresponding path program 2 times [2022-12-12 18:39:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:24,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164920985] [2022-12-12 18:39:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:24,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:24,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164920985] [2022-12-12 18:39:24,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164920985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:24,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:24,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:39:24,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642142286] [2022-12-12 18:39:24,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:24,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:39:24,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:24,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:39:24,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:39:24,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 18:39:24,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 122 transitions, 1383 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:24,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:24,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 18:39:24,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:24,838 INFO L130 PetriNetUnfolder]: 2245/3503 cut-off events. [2022-12-12 18:39:24,838 INFO L131 PetriNetUnfolder]: For 6221/6221 co-relation queries the response was YES. [2022-12-12 18:39:24,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21517 conditions, 3503 events. 2245/3503 cut-off events. For 6221/6221 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 18209 event pairs, 556 based on Foata normal form. 14/3028 useless extension candidates. Maximal degree in co-relation 21491. Up to 2877 conditions per place. [2022-12-12 18:39:24,863 INFO L137 encePairwiseOnDemand]: 52/60 looper letters, 93 selfloop transitions, 34 changer transitions 0/138 dead transitions. [2022-12-12 18:39:24,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 138 transitions, 1829 flow [2022-12-12 18:39:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 18:39:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 18:39:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2022-12-12 18:39:24,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33958333333333335 [2022-12-12 18:39:24,865 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -6 predicate places. [2022-12-12 18:39:24,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 138 transitions, 1829 flow [2022-12-12 18:39:24,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 138 transitions, 1829 flow [2022-12-12 18:39:24,886 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 138 transitions, 1829 flow [2022-12-12 18:39:24,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:24,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:24,886 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:24,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:39:24,886 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:24,887 INFO L85 PathProgramCache]: Analyzing trace with hash -563994529, now seen corresponding path program 3 times [2022-12-12 18:39:24,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:24,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802459992] [2022-12-12 18:39:24,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:24,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:25,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:25,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802459992] [2022-12-12 18:39:25,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802459992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:25,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:25,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:39:25,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149841895] [2022-12-12 18:39:25,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:25,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:39:25,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:25,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:39:25,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:39:25,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 18:39:25,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 138 transitions, 1829 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:25,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:25,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 18:39:25,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:25,779 INFO L130 PetriNetUnfolder]: 2372/3689 cut-off events. [2022-12-12 18:39:25,779 INFO L131 PetriNetUnfolder]: For 7500/7500 co-relation queries the response was YES. [2022-12-12 18:39:25,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25871 conditions, 3689 events. 2372/3689 cut-off events. For 7500/7500 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19297 event pairs, 416 based on Foata normal form. 39/3215 useless extension candidates. Maximal degree in co-relation 25842. Up to 3039 conditions per place. [2022-12-12 18:39:25,806 INFO L137 encePairwiseOnDemand]: 51/60 looper letters, 139 selfloop transitions, 26 changer transitions 0/173 dead transitions. [2022-12-12 18:39:25,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 173 transitions, 2629 flow [2022-12-12 18:39:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:39:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:39:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-12 18:39:25,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 18:39:25,808 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2022-12-12 18:39:25,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 173 transitions, 2629 flow [2022-12-12 18:39:25,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 173 transitions, 2629 flow [2022-12-12 18:39:25,833 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 173 transitions, 2629 flow [2022-12-12 18:39:25,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:25,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:25,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:25,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:39:25,834 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:25,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:25,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1202957337, now seen corresponding path program 1 times [2022-12-12 18:39:25,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:25,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758422948] [2022-12-12 18:39:25,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:25,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:25,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-12 18:39:25,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:25,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758422948] [2022-12-12 18:39:25,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758422948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:25,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:25,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:39:25,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377786708] [2022-12-12 18:39:25,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:25,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:25,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:25,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:25,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:25,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 18:39:25,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 173 transitions, 2629 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-12 18:39:25,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:25,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 18:39:25,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:26,352 INFO L130 PetriNetUnfolder]: 2776/4250 cut-off events. [2022-12-12 18:39:26,352 INFO L131 PetriNetUnfolder]: For 17915/17968 co-relation queries the response was YES. [2022-12-12 18:39:26,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32271 conditions, 4250 events. 2776/4250 cut-off events. For 17915/17968 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 22183 event pairs, 560 based on Foata normal form. 94/3813 useless extension candidates. Maximal degree in co-relation 32239. Up to 3502 conditions per place. [2022-12-12 18:39:26,385 INFO L137 encePairwiseOnDemand]: 49/60 looper letters, 150 selfloop transitions, 30 changer transitions 0/197 dead transitions. [2022-12-12 18:39:26,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 197 transitions, 3343 flow [2022-12-12 18:39:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-12 18:39:26,387 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2022-12-12 18:39:26,387 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 1 predicate places. [2022-12-12 18:39:26,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 197 transitions, 3343 flow [2022-12-12 18:39:26,413 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 197 transitions, 3343 flow [2022-12-12 18:39:26,413 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 197 transitions, 3343 flow [2022-12-12 18:39:26,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-12 18:39:26,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:26,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:26,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:39:26,414 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:26,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1868824890, now seen corresponding path program 1 times [2022-12-12 18:39:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:26,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791249315] [2022-12-12 18:39:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:26,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:26,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791249315] [2022-12-12 18:39:26,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791249315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:26,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:26,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:39:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954053503] [2022-12-12 18:39:26,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:26,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:39:26,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:26,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:39:26,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:39:26,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 18:39:26,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 197 transitions, 3343 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:26,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:26,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 18:39:26,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:26,816 INFO L130 PetriNetUnfolder]: 1348/2330 cut-off events. [2022-12-12 18:39:26,816 INFO L131 PetriNetUnfolder]: For 12883/12986 co-relation queries the response was YES. [2022-12-12 18:39:26,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19770 conditions, 2330 events. 1348/2330 cut-off events. For 12883/12986 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12718 event pairs, 136 based on Foata normal form. 246/2285 useless extension candidates. Maximal degree in co-relation 19735. Up to 1863 conditions per place. [2022-12-12 18:39:26,834 INFO L137 encePairwiseOnDemand]: 49/60 looper letters, 137 selfloop transitions, 51 changer transitions 0/205 dead transitions. [2022-12-12 18:39:26,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 205 transitions, 3824 flow [2022-12-12 18:39:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:39:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:39:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-12 18:39:26,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-12 18:39:26,836 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 3 predicate places. [2022-12-12 18:39:26,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 205 transitions, 3824 flow [2022-12-12 18:39:26,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 205 transitions, 3824 flow [2022-12-12 18:39:26,851 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 205 transitions, 3824 flow [2022-12-12 18:39:26,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:26,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:26,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:26,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:39:26,852 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash -929005642, now seen corresponding path program 1 times [2022-12-12 18:39:26,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:26,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611112355] [2022-12-12 18:39:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:26,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:27,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611112355] [2022-12-12 18:39:27,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611112355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:27,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:27,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:39:27,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897245085] [2022-12-12 18:39:27,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:27,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:27,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:27,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:27,008 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 18:39:27,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 205 transitions, 3824 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:27,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:27,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 18:39:27,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:27,242 INFO L130 PetriNetUnfolder]: 834/1465 cut-off events. [2022-12-12 18:39:27,242 INFO L131 PetriNetUnfolder]: For 11169/11263 co-relation queries the response was YES. [2022-12-12 18:39:27,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13525 conditions, 1465 events. 834/1465 cut-off events. For 11169/11263 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7266 event pairs, 28 based on Foata normal form. 175/1433 useless extension candidates. Maximal degree in co-relation 13487. Up to 1115 conditions per place. [2022-12-12 18:39:27,255 INFO L137 encePairwiseOnDemand]: 49/60 looper letters, 122 selfloop transitions, 60 changer transitions 0/199 dead transitions. [2022-12-12 18:39:27,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 199 transitions, 4068 flow [2022-12-12 18:39:27,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:39:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:39:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-12 18:39:27,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33666666666666667 [2022-12-12 18:39:27,257 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 7 predicate places. [2022-12-12 18:39:27,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 199 transitions, 4068 flow [2022-12-12 18:39:27,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 199 transitions, 4068 flow [2022-12-12 18:39:27,269 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 199 transitions, 4068 flow [2022-12-12 18:39:27,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:27,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:27,269 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:27,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:39:27,269 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:27,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2115122822, now seen corresponding path program 1 times [2022-12-12 18:39:27,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:27,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226468761] [2022-12-12 18:39:27,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:27,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:27,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:27,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226468761] [2022-12-12 18:39:27,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226468761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:27,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:27,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:39:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773441656] [2022-12-12 18:39:27,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:27,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:27,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:27,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:27,494 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 18:39:27,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 199 transitions, 4068 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:27,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:27,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 18:39:27,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:27,843 INFO L130 PetriNetUnfolder]: 1133/2028 cut-off events. [2022-12-12 18:39:27,843 INFO L131 PetriNetUnfolder]: For 13791/13846 co-relation queries the response was YES. [2022-12-12 18:39:27,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20410 conditions, 2028 events. 1133/2028 cut-off events. For 13791/13846 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11226 event pairs, 33 based on Foata normal form. 35/1749 useless extension candidates. Maximal degree in co-relation 20369. Up to 1572 conditions per place. [2022-12-12 18:39:27,855 INFO L137 encePairwiseOnDemand]: 53/60 looper letters, 120 selfloop transitions, 10 changer transitions 141/285 dead transitions. [2022-12-12 18:39:27,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 285 transitions, 6390 flow [2022-12-12 18:39:27,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:39:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:39:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-12 18:39:27,857 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30833333333333335 [2022-12-12 18:39:27,857 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 12 predicate places. [2022-12-12 18:39:27,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 285 transitions, 6390 flow [2022-12-12 18:39:27,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 144 transitions, 3166 flow [2022-12-12 18:39:27,867 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 144 transitions, 3166 flow [2022-12-12 18:39:27,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:27,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:27,867 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:27,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:39:27,868 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:27,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash 938695160, now seen corresponding path program 1 times [2022-12-12 18:39:27,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:27,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647776852] [2022-12-12 18:39:27,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:27,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:28,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:28,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647776852] [2022-12-12 18:39:28,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647776852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:28,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:28,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:39:28,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059515719] [2022-12-12 18:39:28,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:28,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:39:28,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:28,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:39:28,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:39:28,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 18:39:28,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 144 transitions, 3166 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:28,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:28,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 18:39:28,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:28,198 INFO L130 PetriNetUnfolder]: 802/1503 cut-off events. [2022-12-12 18:39:28,198 INFO L131 PetriNetUnfolder]: For 12230/12326 co-relation queries the response was YES. [2022-12-12 18:39:28,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16720 conditions, 1503 events. 802/1503 cut-off events. For 12230/12326 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8046 event pairs, 8 based on Foata normal form. 41/1291 useless extension candidates. Maximal degree in co-relation 16676. Up to 1213 conditions per place. [2022-12-12 18:39:28,205 INFO L137 encePairwiseOnDemand]: 57/60 looper letters, 71 selfloop transitions, 4 changer transitions 125/214 dead transitions. [2022-12-12 18:39:28,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 214 transitions, 5232 flow [2022-12-12 18:39:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:39:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:39:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-12 18:39:28,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3625 [2022-12-12 18:39:28,207 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 10 predicate places. [2022-12-12 18:39:28,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 214 transitions, 5232 flow [2022-12-12 18:39:28,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 89 transitions, 2071 flow [2022-12-12 18:39:28,213 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 89 transitions, 2071 flow [2022-12-12 18:39:28,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:28,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:28,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:28,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:39:28,213 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:28,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1596897574, now seen corresponding path program 1 times [2022-12-12 18:39:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:28,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386298951] [2022-12-12 18:39:28,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:28,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:28,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386298951] [2022-12-12 18:39:28,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386298951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:28,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:28,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 18:39:28,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449936116] [2022-12-12 18:39:28,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:28,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 18:39:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:28,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 18:39:28,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-12 18:39:28,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 18:39:28,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 89 transitions, 2071 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:28,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:28,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 18:39:28,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:29,049 INFO L130 PetriNetUnfolder]: 434/919 cut-off events. [2022-12-12 18:39:29,050 INFO L131 PetriNetUnfolder]: For 6921/6999 co-relation queries the response was YES. [2022-12-12 18:39:29,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10969 conditions, 919 events. 434/919 cut-off events. For 6921/6999 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5240 event pairs, 0 based on Foata normal form. 35/770 useless extension candidates. Maximal degree in co-relation 10922. Up to 832 conditions per place. [2022-12-12 18:39:29,055 INFO L137 encePairwiseOnDemand]: 54/60 looper letters, 82 selfloop transitions, 13 changer transitions 24/132 dead transitions. [2022-12-12 18:39:29,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 132 transitions, 3417 flow [2022-12-12 18:39:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:39:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:39:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-12 18:39:29,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31333333333333335 [2022-12-12 18:39:29,057 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 4 predicate places. [2022-12-12 18:39:29,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 132 transitions, 3417 flow [2022-12-12 18:39:29,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 108 transitions, 2745 flow [2022-12-12 18:39:29,062 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 108 transitions, 2745 flow [2022-12-12 18:39:29,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:29,063 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:29,063 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:29,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 18:39:29,063 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:29,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1504781701, now seen corresponding path program 1 times [2022-12-12 18:39:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:29,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188990199] [2022-12-12 18:39:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:29,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:29,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188990199] [2022-12-12 18:39:29,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188990199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:29,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:29,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 18:39:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028002668] [2022-12-12 18:39:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:29,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 18:39:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:29,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 18:39:29,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-12 18:39:29,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 18:39:29,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 108 transitions, 2745 flow. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:29,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:29,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 18:39:29,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:30,124 INFO L130 PetriNetUnfolder]: 427/968 cut-off events. [2022-12-12 18:39:30,124 INFO L131 PetriNetUnfolder]: For 7222/7285 co-relation queries the response was YES. [2022-12-12 18:39:30,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11914 conditions, 968 events. 427/968 cut-off events. For 7222/7285 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5954 event pairs, 1 based on Foata normal form. 41/815 useless extension candidates. Maximal degree in co-relation 11864. Up to 883 conditions per place. [2022-12-12 18:39:30,129 INFO L137 encePairwiseOnDemand]: 55/60 looper letters, 60 selfloop transitions, 6 changer transitions 52/131 dead transitions. [2022-12-12 18:39:30,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 131 transitions, 3625 flow [2022-12-12 18:39:30,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:39:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:39:30,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-12 18:39:30,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2022-12-12 18:39:30,131 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 9 predicate places. [2022-12-12 18:39:30,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 131 transitions, 3625 flow [2022-12-12 18:39:30,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 79 transitions, 2069 flow [2022-12-12 18:39:30,135 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 2069 flow [2022-12-12 18:39:30,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:30,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:30,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:30,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 18:39:30,136 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash -929723242, now seen corresponding path program 2 times [2022-12-12 18:39:30,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:30,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880783714] [2022-12-12 18:39:30,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:30,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:39:30,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:39:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:39:30,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:39:30,225 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:39:30,225 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 18:39:30,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 18:39:30,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 18:39:30,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 18:39:30,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 18:39:30,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 18:39:30,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 18:39:30,232 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:30,237 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:39:30,237 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:39:30,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:39:30 BasicIcfg [2022-12-12 18:39:30,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:39:30,291 INFO L158 Benchmark]: Toolchain (without parser) took 20246.48ms. Allocated memory was 207.6MB in the beginning and 766.5MB in the end (delta: 558.9MB). Free memory was 181.6MB in the beginning and 591.7MB in the end (delta: -410.1MB). Peak memory consumption was 148.3MB. Max. memory is 8.0GB. [2022-12-12 18:39:30,291 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 184.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:39:30,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.13ms. Allocated memory is still 207.6MB. Free memory was 181.6MB in the beginning and 155.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 18:39:30,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.74ms. Allocated memory is still 207.6MB. Free memory was 155.4MB in the beginning and 152.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 18:39:30,292 INFO L158 Benchmark]: Boogie Preprocessor took 31.79ms. Allocated memory is still 207.6MB. Free memory was 152.3MB in the beginning and 150.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 18:39:30,292 INFO L158 Benchmark]: RCFGBuilder took 566.18ms. Allocated memory is still 207.6MB. Free memory was 150.7MB in the beginning and 115.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-12 18:39:30,292 INFO L158 Benchmark]: TraceAbstraction took 19141.27ms. Allocated memory was 207.6MB in the beginning and 766.5MB in the end (delta: 558.9MB). Free memory was 114.0MB in the beginning and 591.7MB in the end (delta: -477.7MB). Peak memory consumption was 81.2MB. Max. memory is 8.0GB. [2022-12-12 18:39:30,293 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.09ms. Allocated memory is still 207.6MB. Free memory is still 184.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 451.13ms. Allocated memory is still 207.6MB. Free memory was 181.6MB in the beginning and 155.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.74ms. Allocated memory is still 207.6MB. Free memory was 155.4MB in the beginning and 152.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.79ms. Allocated memory is still 207.6MB. Free memory was 152.3MB in the beginning and 150.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 566.18ms. Allocated memory is still 207.6MB. Free memory was 150.7MB in the beginning and 115.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 19141.27ms. Allocated memory was 207.6MB in the beginning and 766.5MB in the end (delta: 558.9MB). Free memory was 114.0MB in the beginning and 591.7MB in the end (delta: -477.7MB). Peak memory consumption was 81.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 113 PlacesBefore, 70 PlacesAfterwards, 105 TransitionsBefore, 60 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3227, independent: 2972, independent conditional: 2972, independent unconditional: 0, dependent: 255, dependent conditional: 255, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3227, independent: 2972, independent conditional: 0, independent unconditional: 2972, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3227, independent: 2972, independent conditional: 0, independent unconditional: 2972, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3227, independent: 2972, independent conditional: 0, independent unconditional: 2972, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1666, independent: 1607, independent conditional: 0, independent unconditional: 1607, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1666, independent: 1589, independent conditional: 0, independent unconditional: 1589, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 415, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 405, dependent conditional: 0, dependent unconditional: 405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3227, independent: 1365, independent conditional: 0, independent unconditional: 1365, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 1666, unknown conditional: 0, unknown unconditional: 1666] , Statistics on independence cache: Total cache size (in pairs): 3208, Positive cache size: 3149, Positive conditional cache size: 0, Positive unconditional cache size: 3149, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=-2, t1403={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=-1, t1403={5:0}, t1404={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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. - 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: 825]: 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, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 455 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1406 IncrementalHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 23 mSDtfsCounter, 1406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4068occurred in iteration=10, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 8821 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 2333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:39:30,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...