/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/safe012_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:14:37,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:14:37,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:14:37,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:14:37,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:14:37,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:14:37,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:14:37,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:14:37,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:14:37,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:14:37,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:14:37,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:14:37,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:14:37,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:14:37,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:14:37,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:14:37,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:14:37,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:14:37,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:14:37,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:14:37,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:14:37,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:14:37,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:14:37,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:14:37,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:14:37,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:14:37,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:14:37,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:14:37,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:14:37,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:14:37,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:14:37,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:14:37,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:14:37,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:14:37,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:14:37,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:14:37,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:14:37,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:14:37,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:14:37,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:14:37,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:14:37,650 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-13 03:14:37,687 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:14:37,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:14:37,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:14:37,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:14:37,689 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:14:37,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:14:37,689 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:14:37,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:14:37,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:14:37,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:14:37,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:14:37,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:14:37,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:14:37,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:14:37,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:14:37,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:14:37,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:14:37,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:14:37,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:14:37,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:14:37,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:14:37,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:14:37,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:14:37,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:14:37,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:14:37,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:14:37,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:14:37,692 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:14:37,692 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-13 03:14:37,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:14:38,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:14:38,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:14:38,003 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:14:38,003 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:14:38,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_tso.i [2022-12-13 03:14:38,950 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:14:39,228 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:14:39,229 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_tso.i [2022-12-13 03:14:39,238 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36bb1e3fe/1c1a6a1dcba6427a85a493dad94176b1/FLAGf67f9135f [2022-12-13 03:14:39,249 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36bb1e3fe/1c1a6a1dcba6427a85a493dad94176b1 [2022-12-13 03:14:39,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:14:39,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:14:39,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:14:39,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:14:39,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:14:39,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52dbab1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39, skipping insertion in model container [2022-12-13 03:14:39,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:14:39,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:14:39,414 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/safe012_tso.i[945,958] [2022-12-13 03:14:39,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:14:39,550 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:14:39,559 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/safe012_tso.i[945,958] [2022-12-13 03:14:39,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:39,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:39,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:14:39,626 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:14:39,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39 WrapperNode [2022-12-13 03:14:39,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:14:39,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:14:39,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:14:39,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:14:39,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,670 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2022-12-13 03:14:39,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:14:39,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:14:39,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:14:39,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:14:39,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,697 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:14:39,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:14:39,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:14:39,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:14:39,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (1/1) ... [2022-12-13 03:14:39,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:14:39,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:14:39,740 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-13 03:14:39,758 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-13 03:14:39,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:14:39,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:14:39,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:14:39,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:14:39,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:14:39,769 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:14:39,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:14:39,769 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:14:39,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:14:39,769 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:14:39,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:14:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:14:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:14:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:14:39,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:14:39,771 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:14:39,877 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:14:39,879 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:14:40,040 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:14:40,046 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:14:40,046 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:14:40,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:14:40 BoogieIcfgContainer [2022-12-13 03:14:40,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:14:40,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:14:40,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:14:40,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:14:40,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:14:39" (1/3) ... [2022-12-13 03:14:40,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1025c2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:14:40, skipping insertion in model container [2022-12-13 03:14:40,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:39" (2/3) ... [2022-12-13 03:14:40,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1025c2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:14:40, skipping insertion in model container [2022-12-13 03:14:40,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:14:40" (3/3) ... [2022-12-13 03:14:40,061 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_tso.i [2022-12-13 03:14:40,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:14:40,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:14:40,081 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:14:40,150 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:14:40,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 86 transitions, 187 flow [2022-12-13 03:14:40,228 INFO L130 PetriNetUnfolder]: 2/83 cut-off events. [2022-12-13 03:14:40,228 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:14:40,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-13 03:14:40,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 86 transitions, 187 flow [2022-12-13 03:14:40,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 71 transitions, 151 flow [2022-12-13 03:14:40,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:40,261 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 71 transitions, 151 flow [2022-12-13 03:14:40,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 71 transitions, 151 flow [2022-12-13 03:14:40,283 INFO L130 PetriNetUnfolder]: 1/71 cut-off events. [2022-12-13 03:14:40,283 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:14:40,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 71 events. 1/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 03:14:40,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 71 transitions, 151 flow [2022-12-13 03:14:40,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-13 03:14:42,112 INFO L241 LiptonReduction]: Total number of compositions: 54 [2022-12-13 03:14:42,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:14:42,136 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;@5150db7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:14:42,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:14:42,144 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-13 03:14:42,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:14:42,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:42,146 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:42,146 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-13 03:14:42,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:42,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1767221015, now seen corresponding path program 1 times [2022-12-13 03:14:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:42,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384871528] [2022-12-13 03:14:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:42,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:42,588 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-13 03:14:42,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:42,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384871528] [2022-12-13 03:14:42,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384871528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:42,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:42,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:14:42,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98033134] [2022-12-13 03:14:42,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:42,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:14:42,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:42,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:14:42,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:14:42,620 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2022-12-13 03:14:42,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:42,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:42,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2022-12-13 03:14:42,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:42,743 INFO L130 PetriNetUnfolder]: 383/646 cut-off events. [2022-12-13 03:14:42,743 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 03:14:42,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 646 events. 383/646 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2968 event pairs, 199 based on Foata normal form. 16/503 useless extension candidates. Maximal degree in co-relation 1282. Up to 519 conditions per place. [2022-12-13 03:14:42,748 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 26 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2022-12-13 03:14:42,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 145 flow [2022-12-13 03:14:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:14:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:14:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 03:14:42,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2022-12-13 03:14:42,758 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-13 03:14:42,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 37 transitions, 145 flow [2022-12-13 03:14:42,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 37 transitions, 145 flow [2022-12-13 03:14:42,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:42,765 INFO L89 Accepts]: Start accepts. Operand has 38 places, 37 transitions, 145 flow [2022-12-13 03:14:42,766 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:42,767 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:42,767 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 37 transitions, 145 flow [2022-12-13 03:14:42,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 37 transitions, 145 flow [2022-12-13 03:14:42,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-13 03:14:42,811 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:42,812 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 03:14:42,812 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 145 flow [2022-12-13 03:14:42,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:42,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:42,812 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:42,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:14:42,813 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-13 03:14:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1050723259, now seen corresponding path program 1 times [2022-12-13 03:14:42,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:42,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317948528] [2022-12-13 03:14:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:42,910 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-13 03:14:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:42,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317948528] [2022-12-13 03:14:42,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317948528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:42,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:42,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:14:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486871784] [2022-12-13 03:14:42,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:42,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:14:42,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:42,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:14:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:14:42,912 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2022-12-13 03:14:42,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:42,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:42,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2022-12-13 03:14:42,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:43,040 INFO L130 PetriNetUnfolder]: 678/1127 cut-off events. [2022-12-13 03:14:43,040 INFO L131 PetriNetUnfolder]: For 158/164 co-relation queries the response was YES. [2022-12-13 03:14:43,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 1127 events. 678/1127 cut-off events. For 158/164 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6045 event pairs, 53 based on Foata normal form. 20/925 useless extension candidates. Maximal degree in co-relation 3083. Up to 784 conditions per place. [2022-12-13 03:14:43,047 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 58 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2022-12-13 03:14:43,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 73 transitions, 419 flow [2022-12-13 03:14:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:14:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:14:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-13 03:14:43,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2022-12-13 03:14:43,049 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-13 03:14:43,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 73 transitions, 419 flow [2022-12-13 03:14:43,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 73 transitions, 419 flow [2022-12-13 03:14:43,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:43,060 INFO L89 Accepts]: Start accepts. Operand has 42 places, 73 transitions, 419 flow [2022-12-13 03:14:43,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:43,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:43,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 73 transitions, 419 flow [2022-12-13 03:14:43,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 73 transitions, 419 flow [2022-12-13 03:14:43,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 03:14:43,066 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:43,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 03:14:43,066 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 73 transitions, 419 flow [2022-12-13 03:14:43,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:43,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:43,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:43,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:14:43,067 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-13 03:14:43,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:43,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1787319199, now seen corresponding path program 1 times [2022-12-13 03:14:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:43,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129283245] [2022-12-13 03:14:43,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:43,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:43,175 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-13 03:14:43,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:43,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129283245] [2022-12-13 03:14:43,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129283245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:43,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:43,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:14:43,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650261174] [2022-12-13 03:14:43,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:43,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:14:43,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:43,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:14:43,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:14:43,177 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 26 [2022-12-13 03:14:43,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 73 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-13 03:14:43,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:43,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 26 [2022-12-13 03:14:43,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:43,261 INFO L130 PetriNetUnfolder]: 649/1086 cut-off events. [2022-12-13 03:14:43,261 INFO L131 PetriNetUnfolder]: For 502/520 co-relation queries the response was YES. [2022-12-13 03:14:43,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3809 conditions, 1086 events. 649/1086 cut-off events. For 502/520 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5799 event pairs, 9 based on Foata normal form. 12/883 useless extension candidates. Maximal degree in co-relation 3792. Up to 743 conditions per place. [2022-12-13 03:14:43,268 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 66 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2022-12-13 03:14:43,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 83 transitions, 619 flow [2022-12-13 03:14:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:14:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:14:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 03:14:43,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 03:14:43,269 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-13 03:14:43,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 83 transitions, 619 flow [2022-12-13 03:14:43,274 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 83 transitions, 619 flow [2022-12-13 03:14:43,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:43,280 INFO L89 Accepts]: Start accepts. Operand has 44 places, 83 transitions, 619 flow [2022-12-13 03:14:43,281 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:43,281 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:43,281 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 83 transitions, 619 flow [2022-12-13 03:14:43,283 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 83 transitions, 619 flow [2022-12-13 03:14:43,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-13 03:14:43,286 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:43,287 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:14:43,287 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 83 transitions, 619 flow [2022-12-13 03:14:43,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-13 03:14:43,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:43,287 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:43,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:14:43,288 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-13 03:14:43,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1787316657, now seen corresponding path program 1 times [2022-12-13 03:14:43,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:43,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031164298] [2022-12-13 03:14:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:43,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:43,350 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-13 03:14:43,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:43,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031164298] [2022-12-13 03:14:43,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031164298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:43,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:43,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:14:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699893344] [2022-12-13 03:14:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:43,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:14:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:43,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:14:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:14:43,352 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2022-12-13 03:14:43,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 83 transitions, 619 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-13 03:14:43,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:43,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2022-12-13 03:14:43,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:43,459 INFO L130 PetriNetUnfolder]: 769/1296 cut-off events. [2022-12-13 03:14:43,460 INFO L131 PetriNetUnfolder]: For 941/981 co-relation queries the response was YES. [2022-12-13 03:14:43,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5690 conditions, 1296 events. 769/1296 cut-off events. For 941/981 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7144 event pairs, 45 based on Foata normal form. 64/1073 useless extension candidates. Maximal degree in co-relation 5670. Up to 939 conditions per place. [2022-12-13 03:14:43,466 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 29 selfloop transitions, 3 changer transitions 50/90 dead transitions. [2022-12-13 03:14:43,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 90 transitions, 833 flow [2022-12-13 03:14:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:14:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:14:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-13 03:14:43,467 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6442307692307693 [2022-12-13 03:14:43,468 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-13 03:14:43,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 90 transitions, 833 flow [2022-12-13 03:14:43,471 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 40 transitions, 343 flow [2022-12-13 03:14:43,479 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:43,479 INFO L89 Accepts]: Start accepts. Operand has 46 places, 40 transitions, 343 flow [2022-12-13 03:14:43,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:43,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:43,480 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 343 flow [2022-12-13 03:14:43,481 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 40 transitions, 343 flow [2022-12-13 03:14:43,481 INFO L226 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-13 03:14:43,601 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:14:43,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 03:14:43,602 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 343 flow [2022-12-13 03:14:43,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-13 03:14:43,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:43,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:43,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:14:43,602 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-13 03:14:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash 428465653, now seen corresponding path program 1 times [2022-12-13 03:14:43,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:43,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968502112] [2022-12-13 03:14:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:43,677 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-13 03:14:43,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:43,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968502112] [2022-12-13 03:14:43,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968502112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:43,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:43,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:14:43,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732862213] [2022-12-13 03:14:43,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:43,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:14:43,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:43,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:14:43,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:14:43,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 03:14:43,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 343 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-13 03:14:43,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:43,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 03:14:43,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:43,771 INFO L130 PetriNetUnfolder]: 471/876 cut-off events. [2022-12-13 03:14:43,771 INFO L131 PetriNetUnfolder]: For 1416/1418 co-relation queries the response was YES. [2022-12-13 03:14:43,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4475 conditions, 876 events. 471/876 cut-off events. For 1416/1418 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4674 event pairs, 30 based on Foata normal form. 122/767 useless extension candidates. Maximal degree in co-relation 4452. Up to 693 conditions per place. [2022-12-13 03:14:43,776 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 30 selfloop transitions, 3 changer transitions 31/70 dead transitions. [2022-12-13 03:14:43,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 760 flow [2022-12-13 03:14:43,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:14:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:14:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 03:14:43,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2022-12-13 03:14:43,778 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-13 03:14:43,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 70 transitions, 760 flow [2022-12-13 03:14:43,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 410 flow [2022-12-13 03:14:43,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:43,787 INFO L89 Accepts]: Start accepts. Operand has 48 places, 39 transitions, 410 flow [2022-12-13 03:14:43,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:43,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:43,788 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 410 flow [2022-12-13 03:14:43,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 39 transitions, 410 flow [2022-12-13 03:14:43,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 03:14:43,790 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:43,791 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 03:14:43,791 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 410 flow [2022-12-13 03:14:43,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-13 03:14:43,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:43,791 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:43,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:14:43,791 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-13 03:14:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1816924516, now seen corresponding path program 1 times [2022-12-13 03:14:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:43,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790295032] [2022-12-13 03:14:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:43,879 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-13 03:14:43,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:43,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790295032] [2022-12-13 03:14:43,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790295032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:43,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:43,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:14:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574436695] [2022-12-13 03:14:43,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:43,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:14:43,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:43,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:14:43,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:14:43,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 03:14:43,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 410 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:43,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:43,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 03:14:43,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:44,104 INFO L130 PetriNetUnfolder]: 619/1018 cut-off events. [2022-12-13 03:14:44,104 INFO L131 PetriNetUnfolder]: For 2923/2932 co-relation queries the response was YES. [2022-12-13 03:14:44,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5772 conditions, 1018 events. 619/1018 cut-off events. For 2923/2932 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 4867 event pairs, 122 based on Foata normal form. 82/862 useless extension candidates. Maximal degree in co-relation 5746. Up to 755 conditions per place. [2022-12-13 03:14:44,112 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 32 selfloop transitions, 18 changer transitions 39/94 dead transitions. [2022-12-13 03:14:44,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 94 transitions, 1161 flow [2022-12-13 03:14:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:14:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:14:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-13 03:14:44,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2022-12-13 03:14:44,129 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2022-12-13 03:14:44,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 94 transitions, 1161 flow [2022-12-13 03:14:44,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 55 transitions, 675 flow [2022-12-13 03:14:44,144 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:44,144 INFO L89 Accepts]: Start accepts. Operand has 50 places, 55 transitions, 675 flow [2022-12-13 03:14:44,161 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:44,161 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:44,161 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 55 transitions, 675 flow [2022-12-13 03:14:44,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 55 transitions, 675 flow [2022-12-13 03:14:44,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 03:14:44,255 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:14:44,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 03:14:44,257 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 55 transitions, 679 flow [2022-12-13 03:14:44,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:44,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:44,257 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:44,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:14:44,258 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-13 03:14:44,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:44,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1204505031, now seen corresponding path program 1 times [2022-12-13 03:14:44,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:44,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243899735] [2022-12-13 03:14:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:44,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:44,426 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-13 03:14:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:44,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243899735] [2022-12-13 03:14:44,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243899735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:44,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:44,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:14:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219503027] [2022-12-13 03:14:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:44,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:14:44,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:44,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:14:44,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:14:44,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2022-12-13 03:14:44,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 55 transitions, 679 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:44,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:44,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2022-12-13 03:14:44,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:44,560 INFO L130 PetriNetUnfolder]: 390/722 cut-off events. [2022-12-13 03:14:44,560 INFO L131 PetriNetUnfolder]: For 2936/3037 co-relation queries the response was YES. [2022-12-13 03:14:44,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4811 conditions, 722 events. 390/722 cut-off events. For 2936/3037 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 3808 event pairs, 42 based on Foata normal form. 108/664 useless extension candidates. Maximal degree in co-relation 4782. Up to 659 conditions per place. [2022-12-13 03:14:44,565 INFO L137 encePairwiseOnDemand]: 13/31 looper letters, 27 selfloop transitions, 31 changer transitions 28/91 dead transitions. [2022-12-13 03:14:44,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 91 transitions, 1265 flow [2022-12-13 03:14:44,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:14:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:14:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-13 03:14:44,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.543010752688172 [2022-12-13 03:14:44,567 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-13 03:14:44,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 91 transitions, 1265 flow [2022-12-13 03:14:44,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 63 transitions, 877 flow [2022-12-13 03:14:44,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:44,575 INFO L89 Accepts]: Start accepts. Operand has 53 places, 63 transitions, 877 flow [2022-12-13 03:14:44,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:44,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:44,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 63 transitions, 877 flow [2022-12-13 03:14:44,577 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 63 transitions, 877 flow [2022-12-13 03:14:44,577 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 03:14:44,578 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:44,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 03:14:44,579 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 63 transitions, 877 flow [2022-12-13 03:14:44,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:44,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:44,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:44,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:14:44,579 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-13 03:14:44,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:44,580 INFO L85 PathProgramCache]: Analyzing trace with hash 799649308, now seen corresponding path program 1 times [2022-12-13 03:14:44,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:44,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111778507] [2022-12-13 03:14:44,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:44,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:14:44,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:44,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111778507] [2022-12-13 03:14:44,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111778507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:44,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:44,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:14:44,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180301162] [2022-12-13 03:14:44,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:44,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:14:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:44,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:14:44,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:14:44,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2022-12-13 03:14:44,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 63 transitions, 877 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:44,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:44,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2022-12-13 03:14:44,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:44,779 INFO L130 PetriNetUnfolder]: 207/426 cut-off events. [2022-12-13 03:14:44,779 INFO L131 PetriNetUnfolder]: For 1964/2067 co-relation queries the response was YES. [2022-12-13 03:14:44,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3234 conditions, 426 events. 207/426 cut-off events. For 1964/2067 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2098 event pairs, 15 based on Foata normal form. 85/419 useless extension candidates. Maximal degree in co-relation 3202. Up to 376 conditions per place. [2022-12-13 03:14:44,785 INFO L137 encePairwiseOnDemand]: 15/31 looper letters, 19 selfloop transitions, 40 changer transitions 0/64 dead transitions. [2022-12-13 03:14:44,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 1011 flow [2022-12-13 03:14:44,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:14:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:14:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-13 03:14:44,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47096774193548385 [2022-12-13 03:14:44,789 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2022-12-13 03:14:44,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 64 transitions, 1011 flow [2022-12-13 03:14:44,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 64 transitions, 1011 flow [2022-12-13 03:14:44,798 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:44,798 INFO L89 Accepts]: Start accepts. Operand has 57 places, 64 transitions, 1011 flow [2022-12-13 03:14:44,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:44,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:44,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 64 transitions, 1011 flow [2022-12-13 03:14:44,801 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 64 transitions, 1011 flow [2022-12-13 03:14:44,801 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 03:14:44,803 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:44,805 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:14:44,805 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 64 transitions, 1011 flow [2022-12-13 03:14:44,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:44,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:44,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:44,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:14:44,805 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1701951305, now seen corresponding path program 1 times [2022-12-13 03:14:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:44,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993997829] [2022-12-13 03:14:44,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:44,966 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-13 03:14:44,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:44,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993997829] [2022-12-13 03:14:44,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993997829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:44,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:44,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:14:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513561045] [2022-12-13 03:14:44,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:44,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:14:44,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:44,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:14:44,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:14:44,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2022-12-13 03:14:44,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 64 transitions, 1011 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:44,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:44,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2022-12-13 03:14:44,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:45,056 INFO L130 PetriNetUnfolder]: 144/345 cut-off events. [2022-12-13 03:14:45,057 INFO L131 PetriNetUnfolder]: For 2152/2253 co-relation queries the response was YES. [2022-12-13 03:14:45,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 345 events. 144/345 cut-off events. For 2152/2253 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1819 event pairs, 6 based on Foata normal form. 87/349 useless extension candidates. Maximal degree in co-relation 2888. Up to 304 conditions per place. [2022-12-13 03:14:45,059 INFO L137 encePairwiseOnDemand]: 14/31 looper letters, 16 selfloop transitions, 40 changer transitions 5/66 dead transitions. [2022-12-13 03:14:45,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 1159 flow [2022-12-13 03:14:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:14:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:14:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-13 03:14:45,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39631336405529954 [2022-12-13 03:14:45,060 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2022-12-13 03:14:45,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 66 transitions, 1159 flow [2022-12-13 03:14:45,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 61 transitions, 1069 flow [2022-12-13 03:14:45,064 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:45,064 INFO L89 Accepts]: Start accepts. Operand has 60 places, 61 transitions, 1069 flow [2022-12-13 03:14:45,065 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:45,065 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:45,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 61 transitions, 1069 flow [2022-12-13 03:14:45,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 61 transitions, 1069 flow [2022-12-13 03:14:45,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-13 03:14:45,067 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:45,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 03:14:45,068 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 1069 flow [2022-12-13 03:14:45,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:45,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:45,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:45,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:14:45,068 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:45,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash -794727937, now seen corresponding path program 1 times [2022-12-13 03:14:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:45,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912240235] [2022-12-13 03:14:45,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:45,140 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-13 03:14:45,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:45,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912240235] [2022-12-13 03:14:45,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912240235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:45,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:45,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:14:45,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156332315] [2022-12-13 03:14:45,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:45,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:14:45,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:45,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:14:45,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:14:45,142 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 03:14:45,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 1069 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:45,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:45,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 03:14:45,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:45,185 INFO L130 PetriNetUnfolder]: 144/263 cut-off events. [2022-12-13 03:14:45,186 INFO L131 PetriNetUnfolder]: For 1815/1875 co-relation queries the response was YES. [2022-12-13 03:14:45,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 263 events. 144/263 cut-off events. For 1815/1875 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1005 event pairs, 0 based on Foata normal form. 33/222 useless extension candidates. Maximal degree in co-relation 2376. Up to 232 conditions per place. [2022-12-13 03:14:45,186 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 0 selfloop transitions, 0 changer transitions 70/70 dead transitions. [2022-12-13 03:14:45,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 1368 flow [2022-12-13 03:14:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:14:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:14:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-13 03:14:45,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43448275862068964 [2022-12-13 03:14:45,188 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2022-12-13 03:14:45,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 70 transitions, 1368 flow [2022-12-13 03:14:45,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:14:45,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:45,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:14:45,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:14:45,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:14:45,190 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:45,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 03:14:45,190 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:14:45,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:45,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 03:14:45,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 03:14:45,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 03:14:45,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 03:14:45,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:14:45,193 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:45,195 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:14:45,195 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:14:45,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:14:45 BasicIcfg [2022-12-13 03:14:45,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:14:45,197 INFO L158 Benchmark]: Toolchain (without parser) took 5945.71ms. Allocated memory was 201.3MB in the beginning and 405.8MB in the end (delta: 204.5MB). Free memory was 176.5MB in the beginning and 333.6MB in the end (delta: -157.2MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. [2022-12-13 03:14:45,197 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:14:45,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.73ms. Allocated memory is still 201.3MB. Free memory was 176.3MB in the beginning and 152.7MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-13 03:14:45,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.61ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 03:14:45,198 INFO L158 Benchmark]: Boogie Preprocessor took 27.95ms. Allocated memory is still 201.3MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:14:45,198 INFO L158 Benchmark]: RCFGBuilder took 348.67ms. Allocated memory is still 201.3MB. Free memory was 149.5MB in the beginning and 135.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 03:14:45,198 INFO L158 Benchmark]: TraceAbstraction took 5146.50ms. Allocated memory was 201.3MB in the beginning and 405.8MB in the end (delta: 204.5MB). Free memory was 134.3MB in the beginning and 333.6MB in the end (delta: -199.3MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2022-12-13 03:14:45,199 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 374.73ms. Allocated memory is still 201.3MB. Free memory was 176.3MB in the beginning and 152.7MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.61ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.95ms. Allocated memory is still 201.3MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 348.67ms. Allocated memory is still 201.3MB. Free memory was 149.5MB in the beginning and 135.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5146.50ms. Allocated memory was 201.3MB in the beginning and 405.8MB in the end (delta: 204.5MB). Free memory was 134.3MB in the beginning and 333.6MB in the end (delta: -199.3MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 80 PlacesBefore, 36 PlacesAfterwards, 71 TransitionsBefore, 27 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 21 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 54 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1267, independent: 1213, independent conditional: 1213, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1267, independent: 1213, independent conditional: 0, independent unconditional: 1213, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1267, independent: 1213, independent conditional: 0, independent unconditional: 1213, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1267, independent: 1213, independent conditional: 0, independent unconditional: 1213, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 846, independent: 814, independent conditional: 0, independent unconditional: 814, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 846, independent: 792, independent conditional: 0, independent unconditional: 792, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1267, independent: 399, independent conditional: 0, independent unconditional: 399, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 846, unknown conditional: 0, unknown unconditional: 846] , Statistics on independence cache: Total cache size (in pairs): 1310, Positive cache size: 1278, Positive conditional cache size: 0, Positive unconditional cache size: 1278, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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, 38 PlacesBefore, 38 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188, independent: 168, independent conditional: 168, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 188, independent: 168, independent conditional: 38, independent unconditional: 130, dependent: 20, dependent conditional: 14, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, independent: 168, independent conditional: 0, independent unconditional: 168, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, independent: 168, independent conditional: 0, independent unconditional: 168, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 79, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 79, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 79, unknown conditional: 0, unknown unconditional: 79] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 393, independent: 370, independent conditional: 370, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 393, independent: 370, independent conditional: 254, independent unconditional: 116, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 416, independent: 370, independent conditional: 23, independent unconditional: 347, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 416, independent: 370, independent conditional: 23, independent unconditional: 347, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 416, independent: 368, independent conditional: 23, independent unconditional: 345, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 277, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 596, independent: 567, independent conditional: 567, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 596, independent: 567, independent conditional: 368, independent unconditional: 199, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 652, independent: 567, independent conditional: 29, independent unconditional: 538, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 652, independent: 567, independent conditional: 29, independent unconditional: 538, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 652, independent: 565, independent conditional: 29, independent unconditional: 536, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 424, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 444, independent conditional: 444, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 444, independent conditional: 168, independent unconditional: 276, dependent: 27, dependent conditional: 26, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 545, independent: 444, independent conditional: 0, independent unconditional: 444, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 545, independent: 444, independent conditional: 0, independent unconditional: 444, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 545, independent: 441, independent conditional: 0, independent unconditional: 441, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 268, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 144 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): 88, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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, 50 PlacesBefore, 50 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 16, independent: 16, independent conditional: 6, independent unconditional: 10, 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: 16, independent: 16, independent conditional: 6, independent unconditional: 10, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 16, independent: 15, independent conditional: 6, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 82 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): 103, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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, 57 PlacesBefore, 57 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 82 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): 103, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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, 60 PlacesBefore, 60 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 80 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): 103, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 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): 103, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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, 109 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: 5.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 647 IncrementalHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 7 mSDtfsCounter, 647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1069occurred in iteration=9, InterpolantAutomatonStates: 47, 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, 1.0s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-13 03:14:45,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...