/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 19:54:25,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 19:54:25,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 19:54:25,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 19:54:25,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 19:54:25,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 19:54:25,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 19:54:25,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 19:54:25,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 19:54:25,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 19:54:25,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 19:54:25,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 19:54:25,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 19:54:25,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 19:54:25,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 19:54:25,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 19:54:25,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 19:54:25,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 19:54:25,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 19:54:25,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 19:54:25,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 19:54:25,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 19:54:25,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 19:54:25,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 19:54:25,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 19:54:25,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 19:54:25,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 19:54:25,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 19:54:25,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 19:54:25,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 19:54:25,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 19:54:25,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 19:54:25,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 19:54:25,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 19:54:25,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 19:54:25,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 19:54:25,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 19:54:25,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 19:54:25,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 19:54:25,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 19:54:25,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 19:54:25,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 19:54:25,553 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 19:54:25,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 19:54:25,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 19:54:25,555 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 19:54:25,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 19:54:25,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 19:54:25,556 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 19:54:25,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 19:54:25,557 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 19:54:25,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 19:54:25,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 19:54:25,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 19:54:25,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 19:54:25,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 19:54:25,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 19:54:25,558 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 19:54:25,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 19:54:25,559 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 19:54:25,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 19:54:25,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 19:54:25,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 19:54:25,559 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 19:54:25,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 19:54:25,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 19:54:25,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 19:54:25,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 19:54:25,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 19:54:25,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 19:54:25,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 19:54:25,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 19:54:25,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 19:54:25,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 19:54:25,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 19:54:25,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 19:54:25,890 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 19:54:25,891 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 19:54:25,893 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2022-12-12 19:54:27,132 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 19:54:27,345 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 19:54:27,345 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2022-12-12 19:54:27,358 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ffaf4fc/95eb9d289e574d76b80c1a7acf51545e/FLAG333947502 [2022-12-12 19:54:27,376 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ffaf4fc/95eb9d289e574d76b80c1a7acf51545e [2022-12-12 19:54:27,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 19:54:27,380 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 19:54:27,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 19:54:27,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 19:54:27,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 19:54:27,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b917318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27, skipping insertion in model container [2022-12-12 19:54:27,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 19:54:27,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 19:54:27,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,625 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-bad-ring.wvr.c[3947,3960] [2022-12-12 19:54:27,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 19:54:27,646 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 19:54:27,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:54:27,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:54:27,691 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-bad-ring.wvr.c[3947,3960] [2022-12-12 19:54:27,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 19:54:27,711 INFO L208 MainTranslator]: Completed translation [2022-12-12 19:54:27,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27 WrapperNode [2022-12-12 19:54:27,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 19:54:27,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 19:54:27,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 19:54:27,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 19:54:27,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,778 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 315 [2022-12-12 19:54:27,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 19:54:27,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 19:54:27,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 19:54:27,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 19:54:27,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,828 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 19:54:27,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 19:54:27,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 19:54:27,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 19:54:27,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (1/1) ... [2022-12-12 19:54:27,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 19:54:27,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:54:27,866 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 19:54:27,876 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 19:54:27,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 19:54:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 19:54:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 19:54:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 19:54:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 19:54:27,900 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 19:54:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 19:54:27,900 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 19:54:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 19:54:27,900 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 19:54:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 19:54:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 19:54:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 19:54:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 19:54:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 19:54:27,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 19:54:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 19:54:27,902 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 19:54:27,998 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 19:54:28,000 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 19:54:28,459 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 19:54:28,582 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 19:54:28,582 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-12 19:54:28,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 07:54:28 BoogieIcfgContainer [2022-12-12 19:54:28,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 19:54:28,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 19:54:28,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 19:54:28,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 19:54:28,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 07:54:27" (1/3) ... [2022-12-12 19:54:28,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db9c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 07:54:28, skipping insertion in model container [2022-12-12 19:54:28,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:54:27" (2/3) ... [2022-12-12 19:54:28,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db9c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 07:54:28, skipping insertion in model container [2022-12-12 19:54:28,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 07:54:28" (3/3) ... [2022-12-12 19:54:28,596 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2022-12-12 19:54:28,613 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 19:54:28,613 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 19:54:28,613 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 19:54:28,706 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-12 19:54:28,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 245 transitions, 514 flow [2022-12-12 19:54:28,906 INFO L130 PetriNetUnfolder]: 22/242 cut-off events. [2022-12-12 19:54:28,906 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 19:54:28,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 242 events. 22/242 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 158 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2022-12-12 19:54:28,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 245 transitions, 514 flow [2022-12-12 19:54:28,921 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 232 transitions, 482 flow [2022-12-12 19:54:28,923 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 19:54:28,944 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-12 19:54:28,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 232 transitions, 482 flow [2022-12-12 19:54:29,015 INFO L130 PetriNetUnfolder]: 22/232 cut-off events. [2022-12-12 19:54:29,016 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 19:54:29,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 232 events. 22/232 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 155 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2022-12-12 19:54:29,021 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-12 19:54:29,021 INFO L226 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-12 19:54:38,331 INFO L241 LiptonReduction]: Total number of compositions: 200 [2022-12-12 19:54:38,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 19:54:38,348 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;@83c88b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 19:54:38,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-12 19:54:38,353 INFO L130 PetriNetUnfolder]: 7/30 cut-off events. [2022-12-12 19:54:38,353 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 19:54:38,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:38,354 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] [2022-12-12 19:54:38,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 19:54:38,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash -32754915, now seen corresponding path program 1 times [2022-12-12 19:54:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:38,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977573618] [2022-12-12 19:54:38,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:38,787 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 19:54:38,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:38,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977573618] [2022-12-12 19:54:38,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977573618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:54:38,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:54:38,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 19:54:38,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949870803] [2022-12-12 19:54:38,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:54:38,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 19:54:38,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:54:38,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 19:54:38,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 19:54:38,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:54:38,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:54:38,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:54:38,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:54:38,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:54:39,015 INFO L130 PetriNetUnfolder]: 472/690 cut-off events. [2022-12-12 19:54:39,016 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-12 19:54:39,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 690 events. 472/690 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2132 event pairs, 135 based on Foata normal form. 30/575 useless extension candidates. Maximal degree in co-relation 1216. Up to 449 conditions per place. [2022-12-12 19:54:39,022 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-12 19:54:39,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 196 flow [2022-12-12 19:54:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 19:54:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 19:54:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-12 19:54:39,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2022-12-12 19:54:39,036 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-12 19:54:39,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 43 transitions, 196 flow [2022-12-12 19:54:39,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 43 transitions, 196 flow [2022-12-12 19:54:39,041 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 43 transitions, 196 flow [2022-12-12 19:54:39,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:54:39,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:39,041 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] [2022-12-12 19:54:39,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 19:54:39,042 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 19:54:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2034944899, now seen corresponding path program 1 times [2022-12-12 19:54:39,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:39,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545208949] [2022-12-12 19:54:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:39,257 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 19:54:39,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:39,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545208949] [2022-12-12 19:54:39,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545208949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:54:39,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:54:39,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 19:54:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294331981] [2022-12-12 19:54:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:54:39,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:54:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:54:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:54:39,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:54:39,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:54:39,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 43 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 19:54:39,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:54:39,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:54:39,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:54:39,447 INFO L130 PetriNetUnfolder]: 529/810 cut-off events. [2022-12-12 19:54:39,447 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-12 19:54:39,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2541 conditions, 810 events. 529/810 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2624 event pairs, 189 based on Foata normal form. 52/712 useless extension candidates. Maximal degree in co-relation 1796. Up to 691 conditions per place. [2022-12-12 19:54:39,453 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 42 selfloop transitions, 2 changer transitions 27/71 dead transitions. [2022-12-12 19:54:39,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 71 transitions, 468 flow [2022-12-12 19:54:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:54:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:54:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-12 19:54:39,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2022-12-12 19:54:39,455 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-12 19:54:39,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 71 transitions, 468 flow [2022-12-12 19:54:39,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 44 transitions, 288 flow [2022-12-12 19:54:39,460 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 44 transitions, 288 flow [2022-12-12 19:54:39,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 19:54:39,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:39,460 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] [2022-12-12 19:54:39,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 19:54:39,461 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 19:54:39,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1350418827, now seen corresponding path program 1 times [2022-12-12 19:54:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:39,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731045957] [2022-12-12 19:54:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:39,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:54:39,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:39,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731045957] [2022-12-12 19:54:39,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731045957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:54:39,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:54:39,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 19:54:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335259836] [2022-12-12 19:54:39,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:54:39,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:54:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:54:39,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:54:39,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:54:39,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:54:39,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 44 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 19:54:39,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:54:39,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:54:39,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:54:39,835 INFO L130 PetriNetUnfolder]: 759/1167 cut-off events. [2022-12-12 19:54:39,836 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-12 19:54:39,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4832 conditions, 1167 events. 759/1167 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4432 event pairs, 381 based on Foata normal form. 56/1035 useless extension candidates. Maximal degree in co-relation 2376. Up to 1167 conditions per place. [2022-12-12 19:54:39,844 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 43 selfloop transitions, 2 changer transitions 35/80 dead transitions. [2022-12-12 19:54:39,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 80 transitions, 688 flow [2022-12-12 19:54:39,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:54:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:54:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-12 19:54:39,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2022-12-12 19:54:39,849 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-12 19:54:39,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 80 transitions, 688 flow [2022-12-12 19:54:39,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 45 transitions, 384 flow [2022-12-12 19:54:39,856 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 45 transitions, 384 flow [2022-12-12 19:54:39,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 19:54:39,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:39,857 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] [2022-12-12 19:54:39,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 19:54:39,857 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 19:54:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash -18787750, now seen corresponding path program 1 times [2022-12-12 19:54:39,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:39,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748329077] [2022-12-12 19:54:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:39,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:54:40,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:40,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748329077] [2022-12-12 19:54:40,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748329077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:54:40,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:54:40,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 19:54:40,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586186220] [2022-12-12 19:54:40,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:54:40,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:54:40,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:54:40,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:54:40,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:54:40,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:54:40,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:54:40,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:54:40,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:54:40,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:54:40,235 INFO L130 PetriNetUnfolder]: 797/1199 cut-off events. [2022-12-12 19:54:40,235 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-12-12 19:54:40,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6152 conditions, 1199 events. 797/1199 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4452 event pairs, 258 based on Foata normal form. 70/1029 useless extension candidates. Maximal degree in co-relation 2956. Up to 1199 conditions per place. [2022-12-12 19:54:40,243 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 44 selfloop transitions, 2 changer transitions 31/77 dead transitions. [2022-12-12 19:54:40,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 77 transitions, 815 flow [2022-12-12 19:54:40,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 19:54:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 19:54:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-12 19:54:40,245 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4274193548387097 [2022-12-12 19:54:40,246 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2022-12-12 19:54:40,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 77 transitions, 815 flow [2022-12-12 19:54:40,253 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 46 transitions, 484 flow [2022-12-12 19:54:40,254 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 46 transitions, 484 flow [2022-12-12 19:54:40,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:54:40,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:40,257 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] [2022-12-12 19:54:40,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 19:54:40,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 19:54:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash -946113063, now seen corresponding path program 1 times [2022-12-12 19:54:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:40,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572638766] [2022-12-12 19:54:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:54:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:40,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572638766] [2022-12-12 19:54:40,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572638766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:54:40,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:54:40,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 19:54:40,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643596580] [2022-12-12 19:54:40,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:54:40,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 19:54:40,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:54:40,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 19:54:40,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 19:54:40,452 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:54:40,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 46 transitions, 484 flow. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:54:40,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:54:40,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:54:40,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:54:40,637 INFO L130 PetriNetUnfolder]: 839/1229 cut-off events. [2022-12-12 19:54:40,637 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-12 19:54:40,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7521 conditions, 1229 events. 839/1229 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4381 event pairs, 145 based on Foata normal form. 1/963 useless extension candidates. Maximal degree in co-relation 6234. Up to 1229 conditions per place. [2022-12-12 19:54:40,648 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 66 selfloop transitions, 3 changer transitions 9/78 dead transitions. [2022-12-12 19:54:40,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 78 transitions, 981 flow [2022-12-12 19:54:40,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 19:54:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 19:54:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-12 19:54:40,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2022-12-12 19:54:40,650 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-12 19:54:40,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 78 transitions, 981 flow [2022-12-12 19:54:40,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 69 transitions, 861 flow [2022-12-12 19:54:40,659 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 69 transitions, 861 flow [2022-12-12 19:54:40,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:54:40,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:40,659 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] [2022-12-12 19:54:40,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 19:54:40,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 19:54:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:40,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1263736278, now seen corresponding path program 1 times [2022-12-12 19:54:40,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:40,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025764499] [2022-12-12 19:54:40,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:40,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:54:40,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:40,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025764499] [2022-12-12 19:54:40,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025764499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:54:40,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940254780] [2022-12-12 19:54:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:40,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:54:40,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:54:40,819 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 19:54:40,839 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 19:54:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:40,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 19:54:40,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:54:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:54:41,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:54:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:54:41,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940254780] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:54:41,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:54:41,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-12 19:54:41,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578214757] [2022-12-12 19:54:41,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:54:41,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 19:54:41,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:54:41,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 19:54:41,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-12 19:54:41,152 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:54:41,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 69 transitions, 861 flow. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:54:41,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:54:41,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:54:41,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:54:41,567 INFO L130 PetriNetUnfolder]: 1007/1498 cut-off events. [2022-12-12 19:54:41,567 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-12 19:54:41,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10659 conditions, 1498 events. 1007/1498 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5762 event pairs, 128 based on Foata normal form. 74/1304 useless extension candidates. Maximal degree in co-relation 6174. Up to 1498 conditions per place. [2022-12-12 19:54:41,580 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 67 selfloop transitions, 3 changer transitions 60/130 dead transitions. [2022-12-12 19:54:41,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 130 transitions, 1880 flow [2022-12-12 19:54:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 19:54:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 19:54:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-12 19:54:41,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2022-12-12 19:54:41,582 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-12 19:54:41,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 130 transitions, 1880 flow [2022-12-12 19:54:41,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 70 transitions, 1013 flow [2022-12-12 19:54:41,592 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 70 transitions, 1013 flow [2022-12-12 19:54:41,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:54:41,592 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:41,593 INFO L214 CegarLoopForPetriNet]: trace histogram [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] [2022-12-12 19:54:41,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-12 19:54:41,803 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,SelfDestructingSolverStorable5 [2022-12-12 19:54:41,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 19:54:41,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:41,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2049426456, now seen corresponding path program 2 times [2022-12-12 19:54:41,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:41,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661123085] [2022-12-12 19:54:41,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:41,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-12 19:54:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:42,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661123085] [2022-12-12 19:54:42,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661123085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:54:42,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:54:42,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 19:54:42,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596684831] [2022-12-12 19:54:42,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:54:42,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 19:54:42,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:54:42,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 19:54:42,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 19:54:42,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:54:42,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 70 transitions, 1013 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 19:54:42,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:54:42,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:54:42,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:54:42,170 INFO L130 PetriNetUnfolder]: 450/662 cut-off events. [2022-12-12 19:54:42,171 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-12 19:54:42,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 662 events. 450/662 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1829 event pairs, 77 based on Foata normal form. 38/559 useless extension candidates. Maximal degree in co-relation 4874. Up to 662 conditions per place. [2022-12-12 19:54:42,182 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 56 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-12-12 19:54:42,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 965 flow [2022-12-12 19:54:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 19:54:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 19:54:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-12 19:54:42,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2022-12-12 19:54:42,187 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-12 19:54:42,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 59 transitions, 965 flow [2022-12-12 19:54:42,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 59 transitions, 965 flow [2022-12-12 19:54:42,193 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 59 transitions, 965 flow [2022-12-12 19:54:42,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 19:54:42,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:42,194 INFO L214 CegarLoopForPetriNet]: trace histogram [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] [2022-12-12 19:54:42,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 19:54:42,194 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 19:54:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:42,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1373677054, now seen corresponding path program 3 times [2022-12-12 19:54:42,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:42,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266716989] [2022-12-12 19:54:42,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:42,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:54:43,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:43,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266716989] [2022-12-12 19:54:43,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266716989] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:54:43,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050779736] [2022-12-12 19:54:43,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 19:54:43,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:54:43,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:54:43,850 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 19:54:43,853 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 19:54:44,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 19:54:44,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:54:44,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-12 19:54:44,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:54:44,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:54:44,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-12 19:54:44,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-12 19:54:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:54:44,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:54:44,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:54:44,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 38 [2022-12-12 19:54:44,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-12 19:54:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:54:44,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050779736] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:54:44,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:54:44,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 30 [2022-12-12 19:54:44,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044211967] [2022-12-12 19:54:44,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:54:44,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-12 19:54:44,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:54:44,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-12 19:54:44,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=790, Unknown=2, NotChecked=0, Total=930 [2022-12-12 19:54:44,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:54:44,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 59 transitions, 965 flow. Second operand has 31 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 30 states have internal predecessors, (74), 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 19:54:44,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:54:44,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:54:44,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:54:48,312 INFO L130 PetriNetUnfolder]: 2323/3488 cut-off events. [2022-12-12 19:54:48,312 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2022-12-12 19:54:48,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31666 conditions, 3488 events. 2323/3488 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15371 event pairs, 195 based on Foata normal form. 104/2740 useless extension candidates. Maximal degree in co-relation 9215. Up to 3488 conditions per place. [2022-12-12 19:54:48,341 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 456 selfloop transitions, 96 changer transitions 40/592 dead transitions. [2022-12-12 19:54:48,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 592 transitions, 10881 flow [2022-12-12 19:54:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-12 19:54:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-12 19:54:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 429 transitions. [2022-12-12 19:54:48,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30752688172043013 [2022-12-12 19:54:48,347 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 59 predicate places. [2022-12-12 19:54:48,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 592 transitions, 10881 flow [2022-12-12 19:54:48,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 552 transitions, 10158 flow [2022-12-12 19:54:48,377 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 552 transitions, 10158 flow [2022-12-12 19:54:48,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 30 states have internal predecessors, (74), 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 19:54:48,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:48,378 INFO L214 CegarLoopForPetriNet]: trace histogram [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] [2022-12-12 19:54:48,386 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 19:54:48,584 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,SelfDestructingSolverStorable7 [2022-12-12 19:54:48,585 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 19:54:48,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:48,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1300085310, now seen corresponding path program 4 times [2022-12-12 19:54:48,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:48,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140138872] [2022-12-12 19:54:48,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:48,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:54:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:49,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140138872] [2022-12-12 19:54:49,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140138872] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:54:49,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347254724] [2022-12-12 19:54:49,449 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 19:54:49,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:54:49,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:54:49,451 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 19:54:49,453 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 19:54:49,612 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 19:54:49,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:54:49,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-12 19:54:49,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:54:49,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:54:49,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-12 19:54:49,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:54:49,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-12 19:54:49,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-12 19:54:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-12 19:54:49,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 19:54:49,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347254724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:54:49,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 19:54:49,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2022-12-12 19:54:49,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596967574] [2022-12-12 19:54:49,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:54:49,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 19:54:49,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:54:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 19:54:49,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-12-12 19:54:49,821 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:54:49,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 552 transitions, 10158 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 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 19:54:49,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:54:49,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:54:49,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:54:50,533 INFO L130 PetriNetUnfolder]: 1759/2712 cut-off events. [2022-12-12 19:54:50,533 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-12 19:54:50,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27355 conditions, 2712 events. 1759/2712 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11739 event pairs, 109 based on Foata normal form. 24/2128 useless extension candidates. Maximal degree in co-relation 7268. Up to 2712 conditions per place. [2022-12-12 19:54:50,554 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 537 selfloop transitions, 35 changer transitions 0/572 dead transitions. [2022-12-12 19:54:50,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 572 transitions, 11677 flow [2022-12-12 19:54:50,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 19:54:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 19:54:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-12-12 19:54:50,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2672811059907834 [2022-12-12 19:54:50,557 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places. [2022-12-12 19:54:50,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 572 transitions, 11677 flow [2022-12-12 19:54:50,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 572 transitions, 11677 flow [2022-12-12 19:54:50,580 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 572 transitions, 11677 flow [2022-12-12 19:54:50,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 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 19:54:50,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:50,580 INFO L214 CegarLoopForPetriNet]: trace histogram [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] [2022-12-12 19:54:50,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 19:54:50,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:54:50,787 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 19:54:50,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2141749947, now seen corresponding path program 1 times [2022-12-12 19:54:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:50,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791758286] [2022-12-12 19:54:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:50,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:54:50,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:50,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791758286] [2022-12-12 19:54:50,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791758286] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:54:50,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125318523] [2022-12-12 19:54:50,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:50,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:54:50,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:54:50,949 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 19:54:50,971 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 19:54:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:51,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 19:54:51,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:54:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:54:51,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:54:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:54:51,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125318523] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:54:51,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:54:51,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-12 19:54:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263788860] [2022-12-12 19:54:51,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:54:51,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 19:54:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:54:51,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 19:54:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-12 19:54:51,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:54:51,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 572 transitions, 11677 flow. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:54:51,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:54:51,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:54:51,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:54:52,284 INFO L130 PetriNetUnfolder]: 2636/4200 cut-off events. [2022-12-12 19:54:52,285 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2022-12-12 19:54:52,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46600 conditions, 4200 events. 2636/4200 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 21096 event pairs, 218 based on Foata normal form. 176/3533 useless extension candidates. Maximal degree in co-relation 7991. Up to 4200 conditions per place. [2022-12-12 19:54:52,354 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 564 selfloop transitions, 11 changer transitions 417/992 dead transitions. [2022-12-12 19:54:52,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 992 transitions, 22244 flow [2022-12-12 19:54:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 19:54:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 19:54:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-12 19:54:52,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3279569892473118 [2022-12-12 19:54:52,356 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 63 predicate places. [2022-12-12 19:54:52,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 992 transitions, 22244 flow [2022-12-12 19:54:52,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 575 transitions, 12887 flow [2022-12-12 19:54:52,383 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 575 transitions, 12887 flow [2022-12-12 19:54:52,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:54:52,383 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:52,384 INFO L214 CegarLoopForPetriNet]: trace histogram [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] [2022-12-12 19:54:52,392 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 19:54:52,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:54:52,590 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 1 more)] === [2022-12-12 19:54:52,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash 186988744, now seen corresponding path program 2 times [2022-12-12 19:54:52,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:52,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754385594] [2022-12-12 19:54:52,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:54:53,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:53,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754385594] [2022-12-12 19:54:53,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754385594] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:54:53,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782818852] [2022-12-12 19:54:53,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 19:54:53,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:54:53,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:54:53,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:54:53,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 19:54:54,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 19:54:54,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:54:54,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-12 19:54:54,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:54:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:54:55,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:55:01,580 INFO L321 Elim1Store]: treesize reduction 4, result has 96.0 percent of original size [2022-12-12 19:55:01,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 109 [2022-12-12 19:55:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-12 19:55:01,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782818852] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 19:55:01,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 19:55:01,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15, 7] total 24 [2022-12-12 19:55:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142379451] [2022-12-12 19:55:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:55:01,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 19:55:01,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:55:01,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 19:55:01,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=493, Unknown=1, NotChecked=0, Total=552 [2022-12-12 19:55:01,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:55:01,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 575 transitions, 12887 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 19:55:01,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:55:01,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:55:01,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:55:03,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:55:05,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:55:06,714 INFO L130 PetriNetUnfolder]: 1874/2940 cut-off events. [2022-12-12 19:55:06,714 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-12-12 19:55:06,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35559 conditions, 2940 events. 1874/2940 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13309 event pairs, 117 based on Foata normal form. 0/2320 useless extension candidates. Maximal degree in co-relation 9166. Up to 2940 conditions per place. [2022-12-12 19:55:06,740 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 609 selfloop transitions, 39 changer transitions 0/648 dead transitions. [2022-12-12 19:55:06,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 648 transitions, 15834 flow [2022-12-12 19:55:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 19:55:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 19:55:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-12 19:55:06,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3172043010752688 [2022-12-12 19:55:06,742 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 66 predicate places. [2022-12-12 19:55:06,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 648 transitions, 15834 flow [2022-12-12 19:55:06,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 648 transitions, 15834 flow [2022-12-12 19:55:06,769 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 648 transitions, 15834 flow [2022-12-12 19:55:06,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 19:55:06,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:55:06,770 INFO L214 CegarLoopForPetriNet]: trace histogram [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] [2022-12-12 19:55:06,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-12 19:55:06,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-12 19:55:06,977 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 1 more)] === [2022-12-12 19:55:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:55:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash -651073974, now seen corresponding path program 3 times [2022-12-12 19:55:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:55:06,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635497785] [2022-12-12 19:55:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:55:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:55:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:55:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:55:08,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:55:08,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635497785] [2022-12-12 19:55:08,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635497785] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:55:08,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240370952] [2022-12-12 19:55:08,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 19:55:08,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:55:08,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:55:08,296 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:55:08,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 19:55:08,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 19:55:08,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:55:08,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-12 19:55:08,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:55:08,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:55:08,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-12 19:55:08,992 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-12 19:55:08,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 12 [2022-12-12 19:55:08,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:55:08,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:55:09,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:55:09,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 199 [2022-12-12 19:55:09,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:55:09,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 101 [2022-12-12 19:55:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:55:10,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240370952] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:55:10,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:55:10,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2022-12-12 19:55:10,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136558915] [2022-12-12 19:55:10,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:55:11,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-12 19:55:11,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:55:11,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-12 19:55:11,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1114, Unknown=18, NotChecked=0, Total=1260 [2022-12-12 19:55:11,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-12 19:55:11,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 648 transitions, 15834 flow. Second operand has 36 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 35 states have internal predecessors, (83), 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 19:55:11,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:55:11,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-12 19:55:11,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:55:17,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:55:23,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:55:25,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 19:55:28,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:55:30,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:56:09,322 WARN L233 SmtUtils]: Spent 30.42s on a formula simplification. DAG size of input: 126 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:56:22,542 WARN L233 SmtUtils]: Spent 10.62s on a formula simplification. DAG size of input: 62 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:56:25,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:56:28,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:56:30,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:56:32,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:56:34,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:56:36,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:56:39,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 19:57:13,732 WARN L233 SmtUtils]: Spent 29.85s on a formula simplification. DAG size of input: 130 DAG size of output: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 20:05:50,026 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-12 20:05:50,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-12-12 20:05:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-12 20:05:50,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-12 20:05:50,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 20:05:50,228 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:491) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 61 more [2022-12-12 20:05:50,232 INFO L158 Benchmark]: Toolchain (without parser) took 682851.39ms. Allocated memory was 205.5MB in the beginning and 659.6MB in the end (delta: 454.0MB). Free memory was 180.8MB in the beginning and 546.0MB in the end (delta: -365.2MB). Peak memory consumption was 90.2MB. Max. memory is 8.0GB. [2022-12-12 20:05:50,232 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory was 182.1MB in the beginning and 182.0MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 20:05:50,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.62ms. Allocated memory is still 205.5MB. Free memory was 180.3MB in the beginning and 166.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-12 20:05:50,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.18ms. Allocated memory is still 205.5MB. Free memory was 166.7MB in the beginning and 164.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 20:05:50,233 INFO L158 Benchmark]: Boogie Preprocessor took 53.10ms. Allocated memory is still 205.5MB. Free memory was 164.0MB in the beginning and 161.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 20:05:50,233 INFO L158 Benchmark]: RCFGBuilder took 755.14ms. Allocated memory is still 205.5MB. Free memory was 161.9MB in the beginning and 120.5MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-12-12 20:05:50,233 INFO L158 Benchmark]: TraceAbstraction took 681641.13ms. Allocated memory was 205.5MB in the beginning and 659.6MB in the end (delta: 454.0MB). Free memory was 119.5MB in the beginning and 546.0MB in the end (delta: -426.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-12 20:05:50,235 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 205.5MB. Free memory was 182.1MB in the beginning and 182.0MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 330.62ms. Allocated memory is still 205.5MB. Free memory was 180.3MB in the beginning and 166.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.18ms. Allocated memory is still 205.5MB. Free memory was 166.7MB in the beginning and 164.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.10ms. Allocated memory is still 205.5MB. Free memory was 164.0MB in the beginning and 161.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 755.14ms. Allocated memory is still 205.5MB. Free memory was 161.9MB in the beginning and 120.5MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 681641.13ms. Allocated memory was 205.5MB in the beginning and 659.6MB in the end (delta: 454.0MB). Free memory was 119.5MB in the beginning and 546.0MB in the end (delta: -426.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 220 PlacesBefore, 34 PlacesAfterwards, 232 TransitionsBefore, 31 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 35 ConcurrentYvCompositions, 14 ChoiceCompositions, 200 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 1198, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1108, independent: 1094, independent conditional: 0, independent unconditional: 1094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1108, independent: 1087, independent conditional: 0, independent unconditional: 1087, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 128, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1222, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1108, unknown conditional: 0, unknown unconditional: 1108] , Statistics on independence cache: Total cache size (in pairs): 1836, Positive cache size: 1822, Positive conditional cache size: 0, Positive unconditional cache size: 1822, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...