/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:19:04,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:19:04,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:19:04,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:19:04,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:19:04,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:19:04,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:19:04,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:19:04,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:19:04,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:19:04,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:19:04,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:19:04,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:19:04,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:19:04,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:19:04,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:19:04,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:19:04,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:19:04,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:19:04,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:19:04,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:19:04,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:19:04,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:19:04,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:19:04,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:19:04,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:19:04,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:19:04,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:19:04,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:19:04,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:19:04,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:19:04,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:19:04,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:19:04,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:19:04,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:19:04,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:19:04,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:19:04,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:19:04,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:19:04,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:19:04,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:19:04,430 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-RepeatedSemanticLbe.epf [2022-12-06 01:19:04,450 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:19:04,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:19:04,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:19:04,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:19:04,451 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:19:04,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:19:04,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:19:04,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:19:04,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:19:04,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:19:04,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:19:04,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:19:04,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:19:04,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:19:04,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:19:04,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:19:04,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:19:04,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:19:04,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:19:04,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:19:04,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:19:04,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:19:04,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:19:04,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:19:04,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:19:04,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:19:04,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:19:04,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:19:04,456 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-06 01:19:04,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:19:04,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:19:04,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:19:04,754 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:19:04,754 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:19:04,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_tso.i [2022-12-06 01:19:05,750 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:19:05,986 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:19:05,987 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_tso.i [2022-12-06 01:19:05,997 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667707923/ada07c7dd4a847dfbb04713a9f49d1fd/FLAG86c6febbb [2022-12-06 01:19:06,009 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667707923/ada07c7dd4a847dfbb04713a9f49d1fd [2022-12-06 01:19:06,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:19:06,012 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:19:06,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:19:06,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:19:06,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:19:06,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377eea05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06, skipping insertion in model container [2022-12-06 01:19:06,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:19:06,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:19:06,173 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_tso.i[945,958] [2022-12-06 01:19:06,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:19:06,340 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:19:06,351 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_tso.i[945,958] [2022-12-06 01:19:06,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:06,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:06,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:19:06,421 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:19:06,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06 WrapperNode [2022-12-06 01:19:06,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:19:06,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:19:06,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:19:06,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:19:06,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,468 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-12-06 01:19:06,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:19:06,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:19:06,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:19:06,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:19:06,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,481 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:19:06,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:19:06,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:19:06,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:19:06,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (1/1) ... [2022-12-06 01:19:06,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:19:06,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:19:06,519 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-06 01:19:06,531 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-06 01:19:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:19:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:19:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:19:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:19:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:19:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:19:06,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:19:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:19:06,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:19:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:19:06,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:19:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:19:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:19:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:19:06,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:19:06,562 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:19:06,678 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:19:06,679 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:19:06,836 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:19:06,841 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:19:06,842 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:19:06,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:19:06 BoogieIcfgContainer [2022-12-06 01:19:06,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:19:06,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:19:06,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:19:06,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:19:06,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:19:06" (1/3) ... [2022-12-06 01:19:06,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b191ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:19:06, skipping insertion in model container [2022-12-06 01:19:06,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:06" (2/3) ... [2022-12-06 01:19:06,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b191ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:19:06, skipping insertion in model container [2022-12-06 01:19:06,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:19:06" (3/3) ... [2022-12-06 01:19:06,849 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_tso.i [2022-12-06 01:19:06,867 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:19:06,867 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:19:06,867 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:19:06,927 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:19:06,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 84 transitions, 183 flow [2022-12-06 01:19:07,001 INFO L130 PetriNetUnfolder]: 2/81 cut-off events. [2022-12-06 01:19:07,001 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:19:07,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-06 01:19:07,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 84 transitions, 183 flow [2022-12-06 01:19:07,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 69 transitions, 147 flow [2022-12-06 01:19:07,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:07,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-06 01:19:07,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 69 transitions, 147 flow [2022-12-06 01:19:07,043 INFO L130 PetriNetUnfolder]: 1/69 cut-off events. [2022-12-06 01:19:07,043 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:19:07,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 1/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 01:19:07,046 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-06 01:19:07,046 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-06 01:19:09,265 INFO L203 LiptonReduction]: Total number of compositions: 52 [2022-12-06 01:19:09,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:19:09,280 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=REPEATED_LIPTON_PN, 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;@2ed90266, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:19:09,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 01:19:09,284 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 01:19:09,284 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:19:09,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:09,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:09,285 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:19:09,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1172746434, now seen corresponding path program 1 times [2022-12-06 01:19:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:09,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316555700] [2022-12-06 01:19:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:09,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:09,641 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-06 01:19:09,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:09,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316555700] [2022-12-06 01:19:09,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316555700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:09,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:09,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:19:09,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497837777] [2022-12-06 01:19:09,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:09,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:19:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:09,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:19:09,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:19:09,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 01:19:09,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 45 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-06 01:19:09,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:09,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 01:19:09,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:09,737 INFO L130 PetriNetUnfolder]: 202/351 cut-off events. [2022-12-06 01:19:09,737 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 01:19:09,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 351 events. 202/351 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1475 event pairs, 52 based on Foata normal form. 6/356 useless extension candidates. Maximal degree in co-relation 700. Up to 296 conditions per place. [2022-12-06 01:19:09,745 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 22 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-06 01:19:09,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 119 flow [2022-12-06 01:19:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:19:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:19:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 01:19:09,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 01:19:09,756 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-06 01:19:09,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:09,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 27 transitions, 119 flow [2022-12-06 01:19:09,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 27 transitions, 119 flow [2022-12-06 01:19:09,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 01:19:09,926 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 01:19:09,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 01:19:09,928 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 117 flow [2022-12-06 01:19:09,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-06 01:19:09,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:09,929 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:09,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:19:09,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:19:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1995400970, now seen corresponding path program 1 times [2022-12-06 01:19:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:09,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464077682] [2022-12-06 01:19:09,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:09,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:10,057 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-06 01:19:10,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:10,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464077682] [2022-12-06 01:19:10,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464077682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:10,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:10,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:19:10,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952689315] [2022-12-06 01:19:10,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:10,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:19:10,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:10,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:19:10,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:19:10,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 01:19:10,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:10,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:10,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 01:19:10,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:10,135 INFO L130 PetriNetUnfolder]: 262/425 cut-off events. [2022-12-06 01:19:10,136 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-06 01:19:10,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 425 events. 262/425 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1523 event pairs, 75 based on Foata normal form. 8/433 useless extension candidates. Maximal degree in co-relation 1234. Up to 353 conditions per place. [2022-12-06 01:19:10,141 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 31 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2022-12-06 01:19:10,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 241 flow [2022-12-06 01:19:10,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:19:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:19:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 01:19:10,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 01:19:10,144 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-06 01:19:10,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:10,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 38 transitions, 241 flow [2022-12-06 01:19:10,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 38 transitions, 241 flow [2022-12-06 01:19:10,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-06 01:19:10,213 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:19:10,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 01:19:10,214 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 38 transitions, 243 flow [2022-12-06 01:19:10,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:10,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:10,215 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:10,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:19:10,215 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:19:10,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:10,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1727888213, now seen corresponding path program 1 times [2022-12-06 01:19:10,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:10,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294251840] [2022-12-06 01:19:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:10,363 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-06 01:19:10,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:10,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294251840] [2022-12-06 01:19:10,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294251840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:10,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:10,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:19:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543265707] [2022-12-06 01:19:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:10,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:19:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:19:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:19:10,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:19:10,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 38 transitions, 243 flow. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-06 01:19:10,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:10,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:19:10,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:10,447 INFO L130 PetriNetUnfolder]: 259/470 cut-off events. [2022-12-06 01:19:10,447 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-06 01:19:10,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 470 events. 259/470 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2077 event pairs, 19 based on Foata normal form. 64/534 useless extension candidates. Maximal degree in co-relation 1820. Up to 393 conditions per place. [2022-12-06 01:19:10,450 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 36 selfloop transitions, 14 changer transitions 0/50 dead transitions. [2022-12-06 01:19:10,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 50 transitions, 408 flow [2022-12-06 01:19:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:19:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:19:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 01:19:10,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 01:19:10,453 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2022-12-06 01:19:10,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:10,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 50 transitions, 408 flow [2022-12-06 01:19:10,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 50 transitions, 408 flow [2022-12-06 01:19:10,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:10,458 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:10,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 01:19:10,459 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 50 transitions, 408 flow [2022-12-06 01:19:10,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-06 01:19:10,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:10,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:10,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:19:10,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:19:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1727887779, now seen corresponding path program 1 times [2022-12-06 01:19:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:10,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094437261] [2022-12-06 01:19:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:10,549 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-06 01:19:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:10,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094437261] [2022-12-06 01:19:10,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094437261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:10,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:10,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:19:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555734032] [2022-12-06 01:19:10,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:10,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:19:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:10,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:19:10,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:19:10,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 01:19:10,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 50 transitions, 408 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 01:19:10,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:10,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 01:19:10,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:10,619 INFO L130 PetriNetUnfolder]: 215/414 cut-off events. [2022-12-06 01:19:10,619 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2022-12-06 01:19:10,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 414 events. 215/414 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1853 event pairs, 8 based on Foata normal form. 24/438 useless extension candidates. Maximal degree in co-relation 1934. Up to 340 conditions per place. [2022-12-06 01:19:10,621 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 55 selfloop transitions, 10 changer transitions 39/112 dead transitions. [2022-12-06 01:19:10,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 112 transitions, 1127 flow [2022-12-06 01:19:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:19:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:19:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 01:19:10,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2022-12-06 01:19:10,623 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2022-12-06 01:19:10,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:10,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 112 transitions, 1127 flow [2022-12-06 01:19:10,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 112 transitions, 1127 flow [2022-12-06 01:19:10,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:10,626 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:10,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 01:19:10,627 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 112 transitions, 1127 flow [2022-12-06 01:19:10,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 01:19:10,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:10,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:10,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:19:10,628 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:19:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1728767097, now seen corresponding path program 1 times [2022-12-06 01:19:10,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:10,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108043852] [2022-12-06 01:19:10,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:10,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:10,687 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-06 01:19:10,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:10,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108043852] [2022-12-06 01:19:10,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108043852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:10,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:10,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:19:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683795593] [2022-12-06 01:19:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:10,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:19:10,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:10,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:19:10,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:19:10,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 01:19:10,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 112 transitions, 1127 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 01:19:10,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:10,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 01:19:10,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:10,746 INFO L130 PetriNetUnfolder]: 192/373 cut-off events. [2022-12-06 01:19:10,746 INFO L131 PetriNetUnfolder]: For 258/258 co-relation queries the response was YES. [2022-12-06 01:19:10,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2071 conditions, 373 events. 192/373 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1602 event pairs, 3 based on Foata normal form. 9/382 useless extension candidates. Maximal degree in co-relation 2048. Up to 303 conditions per place. [2022-12-06 01:19:10,749 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 59 selfloop transitions, 17 changer transitions 52/136 dead transitions. [2022-12-06 01:19:10,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 136 transitions, 1629 flow [2022-12-06 01:19:10,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:19:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:19:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 01:19:10,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 01:19:10,750 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2022-12-06 01:19:10,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:10,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 136 transitions, 1629 flow [2022-12-06 01:19:10,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 136 transitions, 1629 flow [2022-12-06 01:19:10,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:10,754 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:10,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 01:19:10,755 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 136 transitions, 1629 flow [2022-12-06 01:19:10,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 01:19:10,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:10,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:10,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:19:10,755 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:19:10,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2052077606, now seen corresponding path program 1 times [2022-12-06 01:19:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:10,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625591808] [2022-12-06 01:19:10,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:10,851 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-06 01:19:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:10,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625591808] [2022-12-06 01:19:10,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625591808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:10,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:10,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:19:10,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195864243] [2022-12-06 01:19:10,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:10,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:19:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:10,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:19:10,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:19:10,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 01:19:10,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 136 transitions, 1629 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:10,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:10,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 01:19:10,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:10,928 INFO L130 PetriNetUnfolder]: 214/435 cut-off events. [2022-12-06 01:19:10,929 INFO L131 PetriNetUnfolder]: For 373/373 co-relation queries the response was YES. [2022-12-06 01:19:10,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 435 events. 214/435 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2072 event pairs, 3 based on Foata normal form. 5/440 useless extension candidates. Maximal degree in co-relation 2829. Up to 365 conditions per place. [2022-12-06 01:19:10,931 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 61 selfloop transitions, 25 changer transitions 89/175 dead transitions. [2022-12-06 01:19:10,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 175 transitions, 2441 flow [2022-12-06 01:19:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:19:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:19:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 01:19:10,935 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 01:19:10,937 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2022-12-06 01:19:10,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:10,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 175 transitions, 2441 flow [2022-12-06 01:19:10,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 175 transitions, 2441 flow [2022-12-06 01:19:10,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:10,943 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:10,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 01:19:10,944 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 175 transitions, 2441 flow [2022-12-06 01:19:10,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:10,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:10,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:10,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:19:10,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:19:10,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:10,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2049109108, now seen corresponding path program 1 times [2022-12-06 01:19:10,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:10,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842860181] [2022-12-06 01:19:10,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:10,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:11,022 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-06 01:19:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:11,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842860181] [2022-12-06 01:19:11,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842860181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:11,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:11,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:19:11,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128137870] [2022-12-06 01:19:11,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:11,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:19:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:11,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:19:11,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:19:11,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 01:19:11,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 175 transitions, 2441 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:11,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:11,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 01:19:11,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:11,097 INFO L130 PetriNetUnfolder]: 211/423 cut-off events. [2022-12-06 01:19:11,097 INFO L131 PetriNetUnfolder]: For 589/589 co-relation queries the response was YES. [2022-12-06 01:19:11,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3123 conditions, 423 events. 211/423 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1979 event pairs, 2 based on Foata normal form. 5/428 useless extension candidates. Maximal degree in co-relation 3094. Up to 354 conditions per place. [2022-12-06 01:19:11,099 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 35 selfloop transitions, 20 changer transitions 116/175 dead transitions. [2022-12-06 01:19:11,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 175 transitions, 2773 flow [2022-12-06 01:19:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:19:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:19:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-06 01:19:11,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-06 01:19:11,102 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 19 predicate places. [2022-12-06 01:19:11,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:11,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 175 transitions, 2773 flow [2022-12-06 01:19:11,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 175 transitions, 2773 flow [2022-12-06 01:19:11,111 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:11,112 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:11,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 01:19:11,112 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 175 transitions, 2773 flow [2022-12-06 01:19:11,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:11,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:11,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:11,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:19:11,113 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:19:11,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:11,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1138099289, now seen corresponding path program 1 times [2022-12-06 01:19:11,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:11,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837368006] [2022-12-06 01:19:11,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:11,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:11,193 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-06 01:19:11,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:11,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837368006] [2022-12-06 01:19:11,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837368006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:11,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:11,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:19:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593425278] [2022-12-06 01:19:11,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:11,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:19:11,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:11,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:19:11,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:19:11,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 01:19:11,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 175 transitions, 2773 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-06 01:19:11,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:11,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 01:19:11,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:11,289 INFO L130 PetriNetUnfolder]: 215/432 cut-off events. [2022-12-06 01:19:11,289 INFO L131 PetriNetUnfolder]: For 589/589 co-relation queries the response was YES. [2022-12-06 01:19:11,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3596 conditions, 432 events. 215/432 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2032 event pairs, 0 based on Foata normal form. 1/433 useless extension candidates. Maximal degree in co-relation 3564. Up to 361 conditions per place. [2022-12-06 01:19:11,291 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 0 selfloop transitions, 0 changer transitions 221/221 dead transitions. [2022-12-06 01:19:11,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 221 transitions, 3915 flow [2022-12-06 01:19:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:19:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:19:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 01:19:11,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 01:19:11,294 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2022-12-06 01:19:11,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:11,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 221 transitions, 3915 flow [2022-12-06 01:19:11,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 221 transitions, 3915 flow [2022-12-06 01:19:11,300 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:11,300 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:11,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 01:19:11,302 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 221 transitions, 3915 flow [2022-12-06 01:19:11,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-06 01:19:11,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 01:19:11,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 01:19:11,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 01:19:11,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 01:19:11,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:19:11,305 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:11,308 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:19:11,308 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:19:11,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:19:11 BasicIcfg [2022-12-06 01:19:11,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:19:11,311 INFO L158 Benchmark]: Toolchain (without parser) took 5298.96ms. Allocated memory was 188.7MB in the beginning and 300.9MB in the end (delta: 112.2MB). Free memory was 164.4MB in the beginning and 260.0MB in the end (delta: -95.6MB). Peak memory consumption was 16.4MB. Max. memory is 8.0GB. [2022-12-06 01:19:11,311 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory was 165.4MB in the beginning and 165.3MB in the end (delta: 91.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:19:11,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.07ms. Allocated memory is still 188.7MB. Free memory was 164.2MB in the beginning and 140.6MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 01:19:11,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.78ms. Allocated memory is still 188.7MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:19:11,311 INFO L158 Benchmark]: Boogie Preprocessor took 14.91ms. Allocated memory is still 188.7MB. Free memory was 138.5MB in the beginning and 137.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 01:19:11,311 INFO L158 Benchmark]: RCFGBuilder took 359.40ms. Allocated memory is still 188.7MB. Free memory was 136.9MB in the beginning and 123.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 01:19:11,312 INFO L158 Benchmark]: TraceAbstraction took 4465.48ms. Allocated memory was 188.7MB in the beginning and 300.9MB in the end (delta: 112.2MB). Free memory was 122.3MB in the beginning and 260.0MB in the end (delta: -137.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:19:11,313 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory was 165.4MB in the beginning and 165.3MB in the end (delta: 91.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 409.07ms. Allocated memory is still 188.7MB. Free memory was 164.2MB in the beginning and 140.6MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.78ms. Allocated memory is still 188.7MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.91ms. Allocated memory is still 188.7MB. Free memory was 138.5MB in the beginning and 137.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 359.40ms. Allocated memory is still 188.7MB. Free memory was 136.9MB in the beginning and 123.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4465.48ms. Allocated memory was 188.7MB in the beginning and 300.9MB in the end (delta: 112.2MB). Free memory was 122.3MB in the beginning and 260.0MB in the end (delta: -137.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 78 PlacesBefore, 27 PlacesAfterwards, 69 TransitionsBefore, 18 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 52 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 832, independent: 793, independent conditional: 793, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 832, independent: 793, independent conditional: 0, independent unconditional: 793, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 832, independent: 793, independent conditional: 0, independent unconditional: 793, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 832, independent: 793, independent conditional: 0, independent unconditional: 793, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 738, independent: 707, independent conditional: 0, independent unconditional: 707, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 738, independent: 694, independent conditional: 0, independent unconditional: 694, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 132, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 832, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 738, unknown conditional: 0, unknown unconditional: 738] , Statistics on independence cache: Total cache size (in pairs): 1142, Positive cache size: 1111, Positive conditional cache size: 0, Positive unconditional cache size: 1111, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 28 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 175 TransitionsBefore, 175 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 175 TransitionsBefore, 175 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 221 TransitionsBefore, 221 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 107 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 335 IncrementalHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 12 mSDtfsCounter, 335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3915occurred in iteration=8, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:19:11,342 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...