/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 00:43:34,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 00:43:34,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 00:43:34,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 00:43:34,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 00:43:34,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 00:43:34,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 00:43:34,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 00:43:34,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 00:43:34,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 00:43:34,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 00:43:34,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 00:43:34,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 00:43:34,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 00:43:34,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 00:43:34,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 00:43:34,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 00:43:34,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 00:43:34,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 00:43:34,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 00:43:34,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 00:43:34,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 00:43:34,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 00:43:34,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 00:43:34,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 00:43:34,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 00:43:34,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 00:43:34,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 00:43:34,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 00:43:34,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 00:43:34,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 00:43:34,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 00:43:34,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 00:43:34,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 00:43:34,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 00:43:34,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 00:43:34,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 00:43:34,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 00:43:34,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 00:43:34,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 00:43:34,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 00:43:34,704 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-NoLbe.epf [2022-12-12 00:43:34,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 00:43:34,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 00:43:34,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 00:43:34,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 00:43:34,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 00:43:34,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 00:43:34,734 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 00:43:34,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 00:43:34,735 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 00:43:34,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 00:43:34,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 00:43:34,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 00:43:34,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 00:43:34,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 00:43:34,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 00:43:34,735 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 00:43:34,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 00:43:34,736 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 00:43:34,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 00:43:34,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 00:43:34,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 00:43:34,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 00:43:34,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 00:43:34,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 00:43:34,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 00:43:34,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 00:43:34,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 00:43:34,737 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 00:43:34,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 00:43:34,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 00:43:34,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 00:43:34,737 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 00:43:35,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 00:43:35,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 00:43:35,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 00:43:35,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 00:43:35,038 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 00:43:35,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-12-12 00:43:36,099 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 00:43:36,287 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 00:43:36,287 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-12-12 00:43:36,292 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e0c031b/c9f722da76e54aaf9332954f84cf5065/FLAG7b4fdc1a1 [2022-12-12 00:43:36,302 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e0c031b/c9f722da76e54aaf9332954f84cf5065 [2022-12-12 00:43:36,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 00:43:36,305 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 00:43:36,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 00:43:36,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 00:43:36,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 00:43:36,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c4794c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36, skipping insertion in model container [2022-12-12 00:43:36,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 00:43:36,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 00:43:36,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,528 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c[5846,5859] [2022-12-12 00:43:36,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 00:43:36,550 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 00:43:36,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:43:36,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:43:36,600 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c[5846,5859] [2022-12-12 00:43:36,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 00:43:36,617 INFO L208 MainTranslator]: Completed translation [2022-12-12 00:43:36,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36 WrapperNode [2022-12-12 00:43:36,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 00:43:36,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 00:43:36,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 00:43:36,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 00:43:36,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,685 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 456 [2022-12-12 00:43:36,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 00:43:36,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 00:43:36,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 00:43:36,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 00:43:36,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,715 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 00:43:36,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 00:43:36,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 00:43:36,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 00:43:36,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (1/1) ... [2022-12-12 00:43:36,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 00:43:36,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:43:36,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 00:43:36,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 00:43:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 00:43:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 00:43:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 00:43:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 00:43:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 00:43:36,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 00:43:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 00:43:36,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 00:43:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 00:43:36,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 00:43:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-12 00:43:36,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-12 00:43:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 00:43:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 00:43:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 00:43:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 00:43:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 00:43:36,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 00:43:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 00:43:36,798 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 00:43:36,927 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 00:43:36,929 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 00:43:37,531 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 00:43:37,709 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 00:43:37,709 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-12 00:43:37,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:43:37 BoogieIcfgContainer [2022-12-12 00:43:37,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 00:43:37,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 00:43:37,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 00:43:37,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 00:43:37,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 12:43:36" (1/3) ... [2022-12-12 00:43:37,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b514d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:43:37, skipping insertion in model container [2022-12-12 00:43:37,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:43:36" (2/3) ... [2022-12-12 00:43:37,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b514d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:43:37, skipping insertion in model container [2022-12-12 00:43:37,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:43:37" (3/3) ... [2022-12-12 00:43:37,721 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2022-12-12 00:43:37,755 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 00:43:37,756 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 00:43:37,756 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 00:43:37,828 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-12 00:43:37,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 303 transitions, 638 flow [2022-12-12 00:43:37,967 INFO L130 PetriNetUnfolder]: 25/299 cut-off events. [2022-12-12 00:43:37,968 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 00:43:37,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 299 events. 25/299 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 261. Up to 2 conditions per place. [2022-12-12 00:43:37,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 303 transitions, 638 flow [2022-12-12 00:43:37,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 287 transitions, 598 flow [2022-12-12 00:43:38,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 00:43:38,008 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74eae248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 00:43:38,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 00:43:38,062 INFO L130 PetriNetUnfolder]: 25/286 cut-off events. [2022-12-12 00:43:38,062 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 00:43:38,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:38,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:38,064 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 2 more)] === [2022-12-12 00:43:38,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash -288894094, now seen corresponding path program 1 times [2022-12-12 00:43:38,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:38,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586898408] [2022-12-12 00:43:38,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:38,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586898408] [2022-12-12 00:43:38,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586898408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:38,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:38,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 00:43:38,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788764963] [2022-12-12 00:43:38,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:38,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-12 00:43:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:38,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-12 00:43:38,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-12 00:43:38,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 303 [2022-12-12 00:43:38,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 287 transitions, 598 flow. Second operand has 2 states, 2 states have (on average 271.0) internal successors, (542), 2 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:38,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:38,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 303 [2022-12-12 00:43:38,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:38,890 INFO L130 PetriNetUnfolder]: 285/636 cut-off events. [2022-12-12 00:43:38,895 INFO L131 PetriNetUnfolder]: For 88/89 co-relation queries the response was YES. [2022-12-12 00:43:38,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 636 events. 285/636 cut-off events. For 88/89 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1579 event pairs, 147 based on Foata normal form. 147/752 useless extension candidates. Maximal degree in co-relation 831. Up to 387 conditions per place. [2022-12-12 00:43:38,904 INFO L137 encePairwiseOnDemand]: 286/303 looper letters, 20 selfloop transitions, 0 changer transitions 9/270 dead transitions. [2022-12-12 00:43:38,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 270 transitions, 604 flow [2022-12-12 00:43:38,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-12 00:43:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-12 00:43:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 567 transitions. [2022-12-12 00:43:38,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9356435643564357 [2022-12-12 00:43:38,931 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 1 predicate places. [2022-12-12 00:43:38,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 270 transitions, 604 flow [2022-12-12 00:43:38,938 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 261 transitions, 586 flow [2022-12-12 00:43:38,939 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 261 transitions, 586 flow [2022-12-12 00:43:38,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 271.0) internal successors, (542), 2 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:38,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:38,941 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:38,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 00:43:38,941 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 2 more)] === [2022-12-12 00:43:38,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:38,942 INFO L85 PathProgramCache]: Analyzing trace with hash -375824432, now seen corresponding path program 1 times [2022-12-12 00:43:38,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:38,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502046499] [2022-12-12 00:43:38,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:38,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:39,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:39,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502046499] [2022-12-12 00:43:39,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502046499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:39,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:39,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 00:43:39,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098831128] [2022-12-12 00:43:39,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:39,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 00:43:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:39,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 00:43:39,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 00:43:39,563 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 303 [2022-12-12 00:43:39,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 261 transitions, 586 flow. Second operand has 5 states, 5 states have (on average 227.2) internal successors, (1136), 5 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:39,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:39,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 303 [2022-12-12 00:43:39,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:39,762 INFO L130 PetriNetUnfolder]: 309/717 cut-off events. [2022-12-12 00:43:39,762 INFO L131 PetriNetUnfolder]: For 193/290 co-relation queries the response was YES. [2022-12-12 00:43:39,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 717 events. 309/717 cut-off events. For 193/290 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2050 event pairs, 58 based on Foata normal form. 1/691 useless extension candidates. Maximal degree in co-relation 1298. Up to 423 conditions per place. [2022-12-12 00:43:39,777 INFO L137 encePairwiseOnDemand]: 295/303 looper letters, 64 selfloop transitions, 5 changer transitions 4/276 dead transitions. [2022-12-12 00:43:39,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 276 transitions, 807 flow [2022-12-12 00:43:39,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 00:43:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 00:43:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1164 transitions. [2022-12-12 00:43:39,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7683168316831683 [2022-12-12 00:43:39,780 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, -4 predicate places. [2022-12-12 00:43:39,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 271 places, 276 transitions, 807 flow [2022-12-12 00:43:39,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 269 places, 272 transitions, 786 flow [2022-12-12 00:43:39,785 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 272 transitions, 786 flow [2022-12-12 00:43:39,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 227.2) internal successors, (1136), 5 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:39,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:39,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:39,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 00:43:39,787 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 2 more)] === [2022-12-12 00:43:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:39,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1814648897, now seen corresponding path program 1 times [2022-12-12 00:43:39,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:39,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607006700] [2022-12-12 00:43:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:39,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:40,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607006700] [2022-12-12 00:43:40,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607006700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:40,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:40,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 00:43:40,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675666967] [2022-12-12 00:43:40,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:40,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 00:43:40,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:40,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 00:43:40,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 00:43:40,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 303 [2022-12-12 00:43:40,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 272 transitions, 786 flow. Second operand has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:40,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:40,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 303 [2022-12-12 00:43:40,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:40,326 INFO L130 PetriNetUnfolder]: 323/997 cut-off events. [2022-12-12 00:43:40,326 INFO L131 PetriNetUnfolder]: For 530/914 co-relation queries the response was YES. [2022-12-12 00:43:40,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2644 conditions, 997 events. 323/997 cut-off events. For 530/914 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3635 event pairs, 123 based on Foata normal form. 36/974 useless extension candidates. Maximal degree in co-relation 1724. Up to 458 conditions per place. [2022-12-12 00:43:40,332 INFO L137 encePairwiseOnDemand]: 290/303 looper letters, 77 selfloop transitions, 8 changer transitions 52/328 dead transitions. [2022-12-12 00:43:40,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 328 transitions, 1277 flow [2022-12-12 00:43:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 00:43:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 00:43:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2059 transitions. [2022-12-12 00:43:40,336 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.755042170883755 [2022-12-12 00:43:40,337 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 2 predicate places. [2022-12-12 00:43:40,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 328 transitions, 1277 flow [2022-12-12 00:43:40,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 276 transitions, 964 flow [2022-12-12 00:43:40,342 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 276 transitions, 964 flow [2022-12-12 00:43:40,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:40,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:40,343 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:40,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 00:43:40,343 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 2 more)] === [2022-12-12 00:43:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:40,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1246987230, now seen corresponding path program 1 times [2022-12-12 00:43:40,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:40,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566385344] [2022-12-12 00:43:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 00:43:40,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:40,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566385344] [2022-12-12 00:43:40,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566385344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:40,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:40,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 00:43:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295874883] [2022-12-12 00:43:40,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:40,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 00:43:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:40,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 00:43:40,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 00:43:40,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 303 [2022-12-12 00:43:40,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 276 transitions, 964 flow. Second operand has 4 states, 4 states have (on average 262.25) internal successors, (1049), 4 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:40,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:40,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 303 [2022-12-12 00:43:40,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:40,937 INFO L130 PetriNetUnfolder]: 347/871 cut-off events. [2022-12-12 00:43:40,937 INFO L131 PetriNetUnfolder]: For 787/1339 co-relation queries the response was YES. [2022-12-12 00:43:40,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 871 events. 347/871 cut-off events. For 787/1339 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3124 event pairs, 158 based on Foata normal form. 25/846 useless extension candidates. Maximal degree in co-relation 2363. Up to 521 conditions per place. [2022-12-12 00:43:40,946 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 44 selfloop transitions, 6 changer transitions 0/288 dead transitions. [2022-12-12 00:43:40,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 288 transitions, 1181 flow [2022-12-12 00:43:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 00:43:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 00:43:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1073 transitions. [2022-12-12 00:43:40,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8853135313531353 [2022-12-12 00:43:40,949 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 3 predicate places. [2022-12-12 00:43:40,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 288 transitions, 1181 flow [2022-12-12 00:43:40,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 278 places, 288 transitions, 1181 flow [2022-12-12 00:43:40,955 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 288 transitions, 1181 flow [2022-12-12 00:43:40,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 262.25) internal successors, (1049), 4 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:40,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:40,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:40,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 00:43:40,956 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 2 more)] === [2022-12-12 00:43:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash 241311302, now seen corresponding path program 1 times [2022-12-12 00:43:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:40,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090924123] [2022-12-12 00:43:40,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:40,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 00:43:41,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:41,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090924123] [2022-12-12 00:43:41,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090924123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:41,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:41,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 00:43:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836978145] [2022-12-12 00:43:41,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:41,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 00:43:41,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:41,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 00:43:41,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 00:43:41,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 303 [2022-12-12 00:43:41,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 288 transitions, 1181 flow. Second operand has 4 states, 4 states have (on average 262.25) internal successors, (1049), 4 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:41,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:41,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 303 [2022-12-12 00:43:41,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:41,399 INFO L130 PetriNetUnfolder]: 326/830 cut-off events. [2022-12-12 00:43:41,400 INFO L131 PetriNetUnfolder]: For 972/1654 co-relation queries the response was YES. [2022-12-12 00:43:41,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3391 conditions, 830 events. 326/830 cut-off events. For 972/1654 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2806 event pairs, 136 based on Foata normal form. 27/818 useless extension candidates. Maximal degree in co-relation 2549. Up to 498 conditions per place. [2022-12-12 00:43:41,407 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 49 selfloop transitions, 6 changer transitions 0/293 dead transitions. [2022-12-12 00:43:41,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 293 transitions, 1350 flow [2022-12-12 00:43:41,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 00:43:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 00:43:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1074 transitions. [2022-12-12 00:43:41,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8861386138613861 [2022-12-12 00:43:41,414 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 6 predicate places. [2022-12-12 00:43:41,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 293 transitions, 1350 flow [2022-12-12 00:43:41,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 293 transitions, 1350 flow [2022-12-12 00:43:41,420 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 293 transitions, 1350 flow [2022-12-12 00:43:41,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 262.25) internal successors, (1049), 4 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:41,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:41,421 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:41,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 00:43:41,427 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 2 more)] === [2022-12-12 00:43:41,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1217959484, now seen corresponding path program 1 times [2022-12-12 00:43:41,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:41,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911517529] [2022-12-12 00:43:41,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:41,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 00:43:41,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:41,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911517529] [2022-12-12 00:43:41,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911517529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:41,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:41,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 00:43:41,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132831569] [2022-12-12 00:43:41,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:41,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 00:43:41,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:41,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 00:43:41,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 00:43:41,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 303 [2022-12-12 00:43:41,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 293 transitions, 1350 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:41,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:41,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 303 [2022-12-12 00:43:41,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:41,899 INFO L130 PetriNetUnfolder]: 422/1018 cut-off events. [2022-12-12 00:43:41,899 INFO L131 PetriNetUnfolder]: For 1632/2388 co-relation queries the response was YES. [2022-12-12 00:43:41,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4868 conditions, 1018 events. 422/1018 cut-off events. For 1632/2388 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4113 event pairs, 40 based on Foata normal form. 19/989 useless extension candidates. Maximal degree in co-relation 4148. Up to 630 conditions per place. [2022-12-12 00:43:41,908 INFO L137 encePairwiseOnDemand]: 300/303 looper letters, 50 selfloop transitions, 2 changer transitions 3/296 dead transitions. [2022-12-12 00:43:41,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 296 transitions, 1493 flow [2022-12-12 00:43:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 00:43:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 00:43:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2022-12-12 00:43:41,910 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9075907590759076 [2022-12-12 00:43:41,911 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 8 predicate places. [2022-12-12 00:43:41,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 283 places, 296 transitions, 1493 flow [2022-12-12 00:43:41,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 283 places, 293 transitions, 1442 flow [2022-12-12 00:43:41,917 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 293 transitions, 1442 flow [2022-12-12 00:43:41,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:41,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:41,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:41,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 00:43:41,918 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 2 more)] === [2022-12-12 00:43:41,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:41,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1717179232, now seen corresponding path program 1 times [2022-12-12 00:43:41,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:41,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126186040] [2022-12-12 00:43:41,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:41,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 00:43:42,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:42,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126186040] [2022-12-12 00:43:42,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126186040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:42,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:42,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 00:43:42,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668337519] [2022-12-12 00:43:42,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:42,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 00:43:42,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:42,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 00:43:42,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 00:43:42,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 303 [2022-12-12 00:43:42,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 293 transitions, 1442 flow. Second operand has 6 states, 6 states have (on average 223.66666666666666) internal successors, (1342), 6 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:42,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:42,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 303 [2022-12-12 00:43:42,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:42,436 INFO L130 PetriNetUnfolder]: 541/1591 cut-off events. [2022-12-12 00:43:42,436 INFO L131 PetriNetUnfolder]: For 4214/6451 co-relation queries the response was YES. [2022-12-12 00:43:42,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7456 conditions, 1591 events. 541/1591 cut-off events. For 4214/6451 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 8159 event pairs, 175 based on Foata normal form. 15/1483 useless extension candidates. Maximal degree in co-relation 4811. Up to 834 conditions per place. [2022-12-12 00:43:42,448 INFO L137 encePairwiseOnDemand]: 293/303 looper letters, 98 selfloop transitions, 8 changer transitions 53/350 dead transitions. [2022-12-12 00:43:42,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 350 transitions, 2319 flow [2022-12-12 00:43:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 00:43:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 00:43:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2049 transitions. [2022-12-12 00:43:42,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7513751375137514 [2022-12-12 00:43:42,453 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 16 predicate places. [2022-12-12 00:43:42,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 350 transitions, 2319 flow [2022-12-12 00:43:42,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 297 transitions, 1670 flow [2022-12-12 00:43:42,464 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 297 transitions, 1670 flow [2022-12-12 00:43:42,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.66666666666666) internal successors, (1342), 6 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:42,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:42,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:42,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 00:43:42,466 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 2 more)] === [2022-12-12 00:43:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1486160991, now seen corresponding path program 1 times [2022-12-12 00:43:42,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:42,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970597744] [2022-12-12 00:43:42,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:42,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 00:43:42,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:42,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970597744] [2022-12-12 00:43:42,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970597744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:42,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:42,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 00:43:42,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466383868] [2022-12-12 00:43:42,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:42,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 00:43:42,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:42,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 00:43:42,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 00:43:42,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 303 [2022-12-12 00:43:42,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 297 transitions, 1670 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:42,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:42,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 303 [2022-12-12 00:43:42,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:42,912 INFO L130 PetriNetUnfolder]: 424/1097 cut-off events. [2022-12-12 00:43:42,912 INFO L131 PetriNetUnfolder]: For 2702/3418 co-relation queries the response was YES. [2022-12-12 00:43:42,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6366 conditions, 1097 events. 424/1097 cut-off events. For 2702/3418 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4219 event pairs, 33 based on Foata normal form. 5/1065 useless extension candidates. Maximal degree in co-relation 5174. Up to 656 conditions per place. [2022-12-12 00:43:42,920 INFO L137 encePairwiseOnDemand]: 293/303 looper letters, 102 selfloop transitions, 8 changer transitions 23/324 dead transitions. [2022-12-12 00:43:42,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 324 transitions, 2225 flow [2022-12-12 00:43:42,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 00:43:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 00:43:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2029 transitions. [2022-12-12 00:43:42,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.744041070773744 [2022-12-12 00:43:42,925 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 22 predicate places. [2022-12-12 00:43:42,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 324 transitions, 2225 flow [2022-12-12 00:43:42,933 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 301 transitions, 1914 flow [2022-12-12 00:43:42,933 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 301 transitions, 1914 flow [2022-12-12 00:43:42,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:42,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:42,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:42,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 00:43:42,934 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 2 more)] === [2022-12-12 00:43:42,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:42,935 INFO L85 PathProgramCache]: Analyzing trace with hash -232243664, now seen corresponding path program 1 times [2022-12-12 00:43:42,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:42,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896681653] [2022-12-12 00:43:42,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:42,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 00:43:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:43,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896681653] [2022-12-12 00:43:43,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896681653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:43,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:43,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 00:43:43,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31540701] [2022-12-12 00:43:43,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:43,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 00:43:43,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:43,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 00:43:43,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 00:43:43,111 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 303 [2022-12-12 00:43:43,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 301 transitions, 1914 flow. Second operand has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:43,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:43,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 303 [2022-12-12 00:43:43,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:43,358 INFO L130 PetriNetUnfolder]: 434/1267 cut-off events. [2022-12-12 00:43:43,358 INFO L131 PetriNetUnfolder]: For 4481/6868 co-relation queries the response was YES. [2022-12-12 00:43:43,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7356 conditions, 1267 events. 434/1267 cut-off events. For 4481/6868 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6085 event pairs, 61 based on Foata normal form. 9/1215 useless extension candidates. Maximal degree in co-relation 5819. Up to 668 conditions per place. [2022-12-12 00:43:43,367 INFO L137 encePairwiseOnDemand]: 295/303 looper letters, 108 selfloop transitions, 6 changer transitions 18/323 dead transitions. [2022-12-12 00:43:43,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 323 transitions, 2554 flow [2022-12-12 00:43:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 00:43:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 00:43:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1590 transitions. [2022-12-12 00:43:43,370 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7496463932107497 [2022-12-12 00:43:43,371 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 26 predicate places. [2022-12-12 00:43:43,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 323 transitions, 2554 flow [2022-12-12 00:43:43,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 300 places, 305 transitions, 2174 flow [2022-12-12 00:43:43,379 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 305 transitions, 2174 flow [2022-12-12 00:43:43,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:43,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:43,380 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:43,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 00:43:43,380 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 2 more)] === [2022-12-12 00:43:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash -103266198, now seen corresponding path program 1 times [2022-12-12 00:43:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:43,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453327815] [2022-12-12 00:43:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 00:43:43,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:43,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453327815] [2022-12-12 00:43:43,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453327815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:43,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:43,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 00:43:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508807364] [2022-12-12 00:43:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:43,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 00:43:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:43,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 00:43:43,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 00:43:43,612 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 303 [2022-12-12 00:43:43,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 305 transitions, 2174 flow. Second operand has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:43,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:43,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 303 [2022-12-12 00:43:43,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:43,720 INFO L130 PetriNetUnfolder]: 209/675 cut-off events. [2022-12-12 00:43:43,720 INFO L131 PetriNetUnfolder]: For 2767/3037 co-relation queries the response was YES. [2022-12-12 00:43:43,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3917 conditions, 675 events. 209/675 cut-off events. For 2767/3037 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1871 event pairs, 31 based on Foata normal form. 4/637 useless extension candidates. Maximal degree in co-relation 3282. Up to 337 conditions per place. [2022-12-12 00:43:43,725 INFO L137 encePairwiseOnDemand]: 300/303 looper letters, 35 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2022-12-12 00:43:43,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 290 transitions, 1912 flow [2022-12-12 00:43:43,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 00:43:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 00:43:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 809 transitions. [2022-12-12 00:43:43,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.88998899889989 [2022-12-12 00:43:43,727 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 27 predicate places. [2022-12-12 00:43:43,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 290 transitions, 1912 flow [2022-12-12 00:43:43,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 302 places, 290 transitions, 1912 flow [2022-12-12 00:43:43,731 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 290 transitions, 1912 flow [2022-12-12 00:43:43,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:43,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:43,732 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:43,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 00:43:43,732 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 00:43:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:43,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2064325229, now seen corresponding path program 1 times [2022-12-12 00:43:43,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:43,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227674487] [2022-12-12 00:43:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:43,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 00:43:44,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:44,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227674487] [2022-12-12 00:43:44,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227674487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:44,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:44,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 00:43:44,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303122057] [2022-12-12 00:43:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:44,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 00:43:44,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:44,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 00:43:44,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 00:43:44,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 303 [2022-12-12 00:43:44,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 290 transitions, 1912 flow. Second operand has 5 states, 5 states have (on average 262.6) internal successors, (1313), 5 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:44,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:44,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 303 [2022-12-12 00:43:44,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:44,310 INFO L130 PetriNetUnfolder]: 585/1631 cut-off events. [2022-12-12 00:43:44,310 INFO L131 PetriNetUnfolder]: For 10780/12016 co-relation queries the response was YES. [2022-12-12 00:43:44,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11037 conditions, 1631 events. 585/1631 cut-off events. For 10780/12016 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8474 event pairs, 65 based on Foata normal form. 28/1529 useless extension candidates. Maximal degree in co-relation 10341. Up to 867 conditions per place. [2022-12-12 00:43:44,326 INFO L137 encePairwiseOnDemand]: 292/303 looper letters, 63 selfloop transitions, 24 changer transitions 0/337 dead transitions. [2022-12-12 00:43:44,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 337 transitions, 3144 flow [2022-12-12 00:43:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 00:43:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 00:43:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1349 transitions. [2022-12-12 00:43:44,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8904290429042905 [2022-12-12 00:43:44,329 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 31 predicate places. [2022-12-12 00:43:44,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 306 places, 337 transitions, 3144 flow [2022-12-12 00:43:44,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 337 transitions, 3144 flow [2022-12-12 00:43:44,344 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 337 transitions, 3144 flow [2022-12-12 00:43:44,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 262.6) internal successors, (1313), 5 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:44,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:44,345 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:44,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 00:43:44,345 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 00:43:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1820328159, now seen corresponding path program 1 times [2022-12-12 00:43:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:44,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803044274] [2022-12-12 00:43:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 00:43:44,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:44,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803044274] [2022-12-12 00:43:44,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803044274] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:43:44,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299704899] [2022-12-12 00:43:44,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:44,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:43:44,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:43:44,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 00:43:44,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 00:43:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:44,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-12 00:43:44,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:43:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 00:43:45,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:43:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 00:43:45,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299704899] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 00:43:45,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 00:43:45,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-12 00:43:45,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909729824] [2022-12-12 00:43:45,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 00:43:45,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-12 00:43:45,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-12 00:43:45,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-12-12 00:43:45,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 303 [2022-12-12 00:43:45,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 337 transitions, 3144 flow. Second operand has 19 states, 19 states have (on average 214.8421052631579) internal successors, (4082), 19 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:45,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:45,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 303 [2022-12-12 00:43:45,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:46,237 INFO L130 PetriNetUnfolder]: 590/1834 cut-off events. [2022-12-12 00:43:46,238 INFO L131 PetriNetUnfolder]: For 13099/14373 co-relation queries the response was YES. [2022-12-12 00:43:46,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12613 conditions, 1834 events. 590/1834 cut-off events. For 13099/14373 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9087 event pairs, 65 based on Foata normal form. 5/1701 useless extension candidates. Maximal degree in co-relation 11152. Up to 928 conditions per place. [2022-12-12 00:43:46,255 INFO L137 encePairwiseOnDemand]: 281/303 looper letters, 131 selfloop transitions, 26 changer transitions 63/405 dead transitions. [2022-12-12 00:43:46,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 405 transitions, 4414 flow [2022-12-12 00:43:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 00:43:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 00:43:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3690 transitions. [2022-12-12 00:43:46,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.716365754222481 [2022-12-12 00:43:46,262 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 47 predicate places. [2022-12-12 00:43:46,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 405 transitions, 4414 flow [2022-12-12 00:43:46,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 318 places, 342 transitions, 3500 flow [2022-12-12 00:43:46,278 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 342 transitions, 3500 flow [2022-12-12 00:43:46,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 214.8421052631579) internal successors, (4082), 19 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:46,279 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:46,279 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:46,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 00:43:46,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-12 00:43:46,488 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 00:43:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1890823502, now seen corresponding path program 2 times [2022-12-12 00:43:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:46,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359644656] [2022-12-12 00:43:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 00:43:46,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:46,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359644656] [2022-12-12 00:43:46,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359644656] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:43:46,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361501495] [2022-12-12 00:43:46,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 00:43:46,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:43:46,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:43:46,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 00:43:46,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 00:43:47,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 00:43:47,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 00:43:47,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-12 00:43:47,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:43:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 00:43:47,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:43:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 00:43:47,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361501495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 00:43:47,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 00:43:47,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-12-12 00:43:47,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433368993] [2022-12-12 00:43:47,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 00:43:47,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-12 00:43:47,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:47,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-12 00:43:47,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-12-12 00:43:47,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 303 [2022-12-12 00:43:47,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 342 transitions, 3500 flow. Second operand has 28 states, 28 states have (on average 213.60714285714286) internal successors, (5981), 28 states have internal predecessors, (5981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:47,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:47,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 303 [2022-12-12 00:43:47,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:48,747 INFO L130 PetriNetUnfolder]: 600/1879 cut-off events. [2022-12-12 00:43:48,747 INFO L131 PetriNetUnfolder]: For 16031/17511 co-relation queries the response was YES. [2022-12-12 00:43:48,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13906 conditions, 1879 events. 600/1879 cut-off events. For 16031/17511 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9262 event pairs, 65 based on Foata normal form. 9/1747 useless extension candidates. Maximal degree in co-relation 11963. Up to 948 conditions per place. [2022-12-12 00:43:48,767 INFO L137 encePairwiseOnDemand]: 273/303 looper letters, 133 selfloop transitions, 29 changer transitions 73/420 dead transitions. [2022-12-12 00:43:48,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 420 transitions, 5196 flow [2022-12-12 00:43:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-12 00:43:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-12 00:43:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5167 transitions. [2022-12-12 00:43:48,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7105335533553355 [2022-12-12 00:43:48,775 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 66 predicate places. [2022-12-12 00:43:48,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 341 places, 420 transitions, 5196 flow [2022-12-12 00:43:48,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 333 places, 347 transitions, 3876 flow [2022-12-12 00:43:48,792 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 347 transitions, 3876 flow [2022-12-12 00:43:48,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 213.60714285714286) internal successors, (5981), 28 states have internal predecessors, (5981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:48,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:48,794 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:48,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-12 00:43:49,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-12 00:43:49,000 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 00:43:49,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash -22332437, now seen corresponding path program 3 times [2022-12-12 00:43:49,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:49,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103084554] [2022-12-12 00:43:49,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-12 00:43:49,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:49,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103084554] [2022-12-12 00:43:49,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103084554] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:43:49,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747634303] [2022-12-12 00:43:49,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 00:43:49,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:43:49,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:43:49,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 00:43:49,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 00:43:49,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 00:43:49,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 00:43:49,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-12 00:43:49,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:43:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-12 00:43:49,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:43:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-12 00:43:50,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747634303] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 00:43:50,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 00:43:50,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2022-12-12 00:43:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540242690] [2022-12-12 00:43:50,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 00:43:50,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-12 00:43:50,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:50,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-12 00:43:50,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-12-12 00:43:50,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 303 [2022-12-12 00:43:50,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 347 transitions, 3876 flow. Second operand has 22 states, 22 states have (on average 211.9090909090909) internal successors, (4662), 22 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:50,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:50,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 303 [2022-12-12 00:43:50,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:52,596 INFO L130 PetriNetUnfolder]: 2188/6276 cut-off events. [2022-12-12 00:43:52,597 INFO L131 PetriNetUnfolder]: For 69830/75389 co-relation queries the response was YES. [2022-12-12 00:43:52,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53047 conditions, 6276 events. 2188/6276 cut-off events. For 69830/75389 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 50321 event pairs, 170 based on Foata normal form. 425/6228 useless extension candidates. Maximal degree in co-relation 22597. Up to 3360 conditions per place. [2022-12-12 00:43:52,777 INFO L137 encePairwiseOnDemand]: 272/303 looper letters, 272 selfloop transitions, 53 changer transitions 245/751 dead transitions. [2022-12-12 00:43:52,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 751 transitions, 15211 flow [2022-12-12 00:43:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-12 00:43:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-12-12 00:43:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 11128 transitions. [2022-12-12 00:43:52,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6929447661747307 [2022-12-12 00:43:52,790 INFO L295 CegarLoopForPetriNet]: 275 programPoint places, 110 predicate places. [2022-12-12 00:43:52,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 385 places, 751 transitions, 15211 flow [2022-12-12 00:43:52,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 365 places, 506 transitions, 8652 flow [2022-12-12 00:43:52,846 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 506 transitions, 8652 flow [2022-12-12 00:43:52,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 211.9090909090909) internal successors, (4662), 22 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 00:43:52,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:52,848 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:43:52,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-12 00:43:53,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:43:53,055 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 00:43:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1983084830, now seen corresponding path program 1 times [2022-12-12 00:43:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:53,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098759649] [2022-12-12 00:43:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:44:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:44:05,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:44:05,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098759649] [2022-12-12 00:44:05,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098759649] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:44:05,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206448593] [2022-12-12 00:44:05,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:44:05,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:44:05,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:44:05,749 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 00:44:05,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 00:44:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:44:05,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 179 conjunts are in the unsatisfiable core [2022-12-12 00:44:05,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:44:09,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 00:44:10,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 00:44:12,201 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-12 00:44:12,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-12 00:44:12,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 00:44:14,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 00:44:14,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 00:44:14,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 00:44:15,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 00:44:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:44:18,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:45:27,889 WARN L233 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 147 DAG size of output: 145 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:46:12,828 WARN L233 SmtUtils]: Spent 18.51s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:46:32,650 WARN L233 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:47:56,950 WARN L233 SmtUtils]: Spent 12.43s on a formula simplification that was a NOOP. DAG size: 179 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:50:43,828 WARN L233 SmtUtils]: Spent 20.52s on a formula simplification that was a NOOP. DAG size: 212 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:51:32,825 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 157 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:52:17,909 WARN L233 SmtUtils]: Spent 9.88s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:53:21,171 WARN L233 SmtUtils]: Spent 17.24s on a formula simplification that was a NOOP. DAG size: 155 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:54:24,142 WARN L233 SmtUtils]: Spent 14.90s on a formula simplification that was a NOOP. DAG size: 155 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:55:28,551 WARN L233 SmtUtils]: Spent 16.80s on a formula simplification that was a NOOP. DAG size: 155 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:56:31,412 WARN L233 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 290 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 00:57:42,131 WARN L233 SmtUtils]: Spent 14.46s on a formula simplification that was a NOOP. DAG size: 293 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-12-12 00:57:58,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 00:57:58,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-12 00:57:58,120 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 00:57:58,120 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 00:57:58,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-12 00:57:58,304 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 283 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 171 known predicates. [2022-12-12 00:57:58,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-12 00:57:58,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 00:57:58,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 00:57:58,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-12 00:57:58,305 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 00:57:58,308 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 00:57:58,308 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 00:57:58,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 12:57:58 BasicIcfg [2022-12-12 00:57:58,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 00:57:58,310 INFO L158 Benchmark]: Toolchain (without parser) took 862004.89ms. Allocated memory was 191.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 168.1MB in the beginning and 830.2MB in the end (delta: -662.1MB). Peak memory consumption was 410.1MB. Max. memory is 8.0GB. [2022-12-12 00:57:58,310 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 00:57:58,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.71ms. Allocated memory is still 191.9MB. Free memory was 168.1MB in the beginning and 151.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-12 00:57:58,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.44ms. Allocated memory is still 191.9MB. Free memory was 151.3MB in the beginning and 148.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 00:57:58,311 INFO L158 Benchmark]: Boogie Preprocessor took 33.57ms. Allocated memory is still 191.9MB. Free memory was 148.2MB in the beginning and 145.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 00:57:58,311 INFO L158 Benchmark]: RCFGBuilder took 993.65ms. Allocated memory is still 191.9MB. Free memory was 145.6MB in the beginning and 75.3MB in the end (delta: 70.3MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2022-12-12 00:57:58,311 INFO L158 Benchmark]: TraceAbstraction took 860594.40ms. Allocated memory was 191.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 74.2MB in the beginning and 830.2MB in the end (delta: -755.9MB). Peak memory consumption was 316.8MB. Max. memory is 8.0GB. [2022-12-12 00:57:58,312 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 191.9MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 311.71ms. Allocated memory is still 191.9MB. Free memory was 168.1MB in the beginning and 151.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.44ms. Allocated memory is still 191.9MB. Free memory was 151.3MB in the beginning and 148.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.57ms. Allocated memory is still 191.9MB. Free memory was 148.2MB in the beginning and 145.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 993.65ms. Allocated memory is still 191.9MB. Free memory was 145.6MB in the beginning and 75.3MB in the end (delta: 70.3MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * TraceAbstraction took 860594.40ms. Allocated memory was 191.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 74.2MB in the beginning and 830.2MB in the end (delta: -755.9MB). Peak memory consumption was 316.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 186]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 283 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 171 known predicates. - TimeoutResultAtElement [Line: 179]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 283 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 171 known predicates. - TimeoutResultAtElement [Line: 178]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 283 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 171 known predicates. - TimeoutResultAtElement [Line: 176]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 283 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 171 known predicates. - TimeoutResultAtElement [Line: 177]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 283 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 171 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 319 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 860.5s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2124 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2124 mSDsluCounter, 1339 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 990 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3344 IncrementalHoareTripleChecker+Invalid, 3505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 349 mSDtfsCounter, 3344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1776 GetRequests, 1590 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8652occurred in iteration=14, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 10536 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 4126 NumberOfCodeBlocks, 4093 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4910 ConstructedInterpolants, 0 QuantifiedInterpolants, 12797 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2029 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 184/228 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown