/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 21:54:02,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 21:54:02,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 21:54:02,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 21:54:02,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 21:54:02,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 21:54:02,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 21:54:02,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 21:54:02,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 21:54:02,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 21:54:02,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 21:54:02,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 21:54:02,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 21:54:02,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 21:54:02,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 21:54:02,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 21:54:02,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 21:54:02,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 21:54:02,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 21:54:02,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 21:54:02,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 21:54:02,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 21:54:02,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 21:54:02,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 21:54:02,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 21:54:02,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 21:54:02,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 21:54:02,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 21:54:02,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 21:54:02,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 21:54:02,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 21:54:02,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 21:54:02,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 21:54:02,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 21:54:02,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 21:54:02,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 21:54:02,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 21:54:02,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 21:54:02,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 21:54:02,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 21:54:02,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 21:54:02,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 21:54:02,116 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 21:54:02,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 21:54:02,117 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 21:54:02,117 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 21:54:02,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 21:54:02,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 21:54:02,118 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 21:54:02,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 21:54:02,118 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 21:54:02,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 21:54:02,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 21:54:02,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 21:54:02,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 21:54:02,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 21:54:02,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 21:54:02,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 21:54:02,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 21:54:02,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 21:54:02,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 21:54:02,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 21:54:02,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 21:54:02,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 21:54:02,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 21:54:02,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:54:02,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 21:54:02,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 21:54:02,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 21:54:02,120 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 21:54:02,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 21:54:02,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 21:54:02,121 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 21:54:02,121 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-11 21:54:02,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 21:54:02,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 21:54:02,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 21:54:02,545 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 21:54:02,546 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 21:54:02,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-12-11 21:54:03,575 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 21:54:03,769 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 21:54:03,769 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-12-11 21:54:03,774 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e55d60ca/4c1c8ddf2a5a42f98ec433476607d159/FLAG34d04c6f8 [2022-12-11 21:54:03,783 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e55d60ca/4c1c8ddf2a5a42f98ec433476607d159 [2022-12-11 21:54:03,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 21:54:03,785 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 21:54:03,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 21:54:03,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 21:54:03,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 21:54:03,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:03,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc585fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03, skipping insertion in model container [2022-12-11 21:54:03,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:03,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 21:54:03,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 21:54:03,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,914 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/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-12-11 21:54:03,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:54:03,925 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 21:54:03,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:54:03,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:54:03,944 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/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-12-11 21:54:03,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:54:03,956 INFO L208 MainTranslator]: Completed translation [2022-12-11 21:54:03,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03 WrapperNode [2022-12-11 21:54:03,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 21:54:03,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 21:54:03,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 21:54:03,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 21:54:03,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:03,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:04,004 INFO L138 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2022-12-11 21:54:04,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 21:54:04,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 21:54:04,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 21:54:04,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 21:54:04,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:04,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:04,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:04,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:04,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:04,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:04,037 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:04,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:04,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 21:54:04,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 21:54:04,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 21:54:04,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 21:54:04,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (1/1) ... [2022-12-11 21:54:04,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:54:04,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:54:04,073 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-11 21:54:04,101 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-11 21:54:04,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 21:54:04,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 21:54:04,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 21:54:04,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 21:54:04,116 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 21:54:04,116 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 21:54:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 21:54:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 21:54:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-11 21:54:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-11 21:54:04,118 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-11 21:54:04,118 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-11 21:54:04,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 21:54:04,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 21:54:04,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 21:54:04,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-11 21:54:04,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 21:54:04,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 21:54:04,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 21:54:04,121 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 21:54:04,252 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 21:54:04,253 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 21:54:04,570 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 21:54:04,690 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 21:54:04,691 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-11 21:54:04,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:54:04 BoogieIcfgContainer [2022-12-11 21:54:04,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 21:54:04,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 21:54:04,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 21:54:04,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 21:54:04,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 09:54:03" (1/3) ... [2022-12-11 21:54:04,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab5d2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:54:04, skipping insertion in model container [2022-12-11 21:54:04,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:54:03" (2/3) ... [2022-12-11 21:54:04,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab5d2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:54:04, skipping insertion in model container [2022-12-11 21:54:04,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:54:04" (3/3) ... [2022-12-11 21:54:04,699 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-12-11 21:54:04,713 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 21:54:04,713 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 21:54:04,713 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 21:54:04,815 INFO L144 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-12-11 21:54:04,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 193 transitions, 430 flow [2022-12-11 21:54:04,954 INFO L130 PetriNetUnfolder]: 14/178 cut-off events. [2022-12-11 21:54:04,954 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-11 21:54:04,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 178 events. 14/178 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 155 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 152. Up to 3 conditions per place. [2022-12-11 21:54:04,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 193 transitions, 430 flow [2022-12-11 21:54:04,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 170 transitions, 370 flow [2022-12-11 21:54:04,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 21:54:04,982 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;@182742ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 21:54:04,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 21:54:05,012 INFO L130 PetriNetUnfolder]: 14/169 cut-off events. [2022-12-11 21:54:05,012 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-11 21:54:05,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:05,013 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:05,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:05,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash -553476129, now seen corresponding path program 1 times [2022-12-11 21:54:05,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:05,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256490163] [2022-12-11 21:54:05,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:05,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:05,210 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-11 21:54:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:05,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256490163] [2022-12-11 21:54:05,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256490163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:54:05,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:54:05,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 21:54:05,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877436402] [2022-12-11 21:54:05,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:54:05,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-11 21:54:05,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:05,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-11 21:54:05,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-11 21:54:05,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 195 [2022-12-11 21:54:05,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 170 transitions, 370 flow. Second operand has 2 states, 2 states have (on average 169.0) internal successors, (338), 2 states have internal predecessors, (338), 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-11 21:54:05,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:05,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 195 [2022-12-11 21:54:05,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:05,393 INFO L130 PetriNetUnfolder]: 191/583 cut-off events. [2022-12-11 21:54:05,393 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-11 21:54:05,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 583 events. 191/583 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2309 event pairs, 111 based on Foata normal form. 64/595 useless extension candidates. Maximal degree in co-relation 865. Up to 286 conditions per place. [2022-12-11 21:54:05,398 INFO L137 encePairwiseOnDemand]: 187/195 looper letters, 21 selfloop transitions, 0 changer transitions 4/162 dead transitions. [2022-12-11 21:54:05,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 162 transitions, 396 flow [2022-12-11 21:54:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-11 21:54:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-11 21:54:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 351 transitions. [2022-12-11 21:54:05,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9 [2022-12-11 21:54:05,410 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 1 predicate places. [2022-12-11 21:54:05,411 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 162 transitions, 396 flow [2022-12-11 21:54:05,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 158 transitions, 388 flow [2022-12-11 21:54:05,416 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 158 transitions, 388 flow [2022-12-11 21:54:05,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 169.0) internal successors, (338), 2 states have internal predecessors, (338), 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-11 21:54:05,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:05,416 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:05,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 21:54:05,417 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:05,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash 468186242, now seen corresponding path program 1 times [2022-12-11 21:54:05,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:05,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333703572] [2022-12-11 21:54:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:05,856 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-11 21:54:05,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:05,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333703572] [2022-12-11 21:54:05,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333703572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:54:05,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:54:05,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:54:05,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937703259] [2022-12-11 21:54:05,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:54:05,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:54:05,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:05,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:54:05,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:54:05,860 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 195 [2022-12-11 21:54:05,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 158 transitions, 388 flow. Second operand has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 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-11 21:54:05,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:05,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 195 [2022-12-11 21:54:05,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:06,232 INFO L130 PetriNetUnfolder]: 481/1331 cut-off events. [2022-12-11 21:54:06,232 INFO L131 PetriNetUnfolder]: For 583/671 co-relation queries the response was YES. [2022-12-11 21:54:06,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3077 conditions, 1331 events. 481/1331 cut-off events. For 583/671 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8097 event pairs, 95 based on Foata normal form. 1/1202 useless extension candidates. Maximal degree in co-relation 2829. Up to 716 conditions per place. [2022-12-11 21:54:06,244 INFO L137 encePairwiseOnDemand]: 184/195 looper letters, 69 selfloop transitions, 10 changer transitions 4/200 dead transitions. [2022-12-11 21:54:06,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 200 transitions, 756 flow [2022-12-11 21:54:06,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 21:54:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 21:54:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions. [2022-12-11 21:54:06,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7743589743589744 [2022-12-11 21:54:06,251 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 2 predicate places. [2022-12-11 21:54:06,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 200 transitions, 756 flow [2022-12-11 21:54:06,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 196 transitions, 735 flow [2022-12-11 21:54:06,260 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 196 transitions, 735 flow [2022-12-11 21:54:06,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 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-11 21:54:06,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:06,261 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:06,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 21:54:06,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:06,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1140873024, now seen corresponding path program 2 times [2022-12-11 21:54:06,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:06,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564071115] [2022-12-11 21:54:06,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:06,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:06,476 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-11 21:54:06,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:06,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564071115] [2022-12-11 21:54:06,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564071115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:54:06,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:54:06,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:54:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983501897] [2022-12-11 21:54:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:54:06,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:54:06,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:06,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:54:06,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:54:06,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 195 [2022-12-11 21:54:06,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 196 transitions, 735 flow. Second operand has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 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-11 21:54:06,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:06,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 195 [2022-12-11 21:54:06,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:06,818 INFO L130 PetriNetUnfolder]: 703/1880 cut-off events. [2022-12-11 21:54:06,818 INFO L131 PetriNetUnfolder]: For 1462/1654 co-relation queries the response was YES. [2022-12-11 21:54:06,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5467 conditions, 1880 events. 703/1880 cut-off events. For 1462/1654 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12684 event pairs, 169 based on Foata normal form. 11/1724 useless extension candidates. Maximal degree in co-relation 5081. Up to 1047 conditions per place. [2022-12-11 21:54:06,834 INFO L137 encePairwiseOnDemand]: 185/195 looper letters, 106 selfloop transitions, 10 changer transitions 4/237 dead transitions. [2022-12-11 21:54:06,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 237 transitions, 1252 flow [2022-12-11 21:54:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 21:54:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 21:54:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions. [2022-12-11 21:54:06,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7743589743589744 [2022-12-11 21:54:06,839 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 5 predicate places. [2022-12-11 21:54:06,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 237 transitions, 1252 flow [2022-12-11 21:54:06,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 233 transitions, 1223 flow [2022-12-11 21:54:06,850 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 233 transitions, 1223 flow [2022-12-11 21:54:06,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 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-11 21:54:06,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:06,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:06,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 21:54:06,851 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:06,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1288367027, now seen corresponding path program 1 times [2022-12-11 21:54:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:06,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127825885] [2022-12-11 21:54:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:07,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127825885] [2022-12-11 21:54:07,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127825885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:54:07,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:54:07,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:54:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167654191] [2022-12-11 21:54:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:54:07,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:54:07,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:07,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:54:07,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:54:07,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 195 [2022-12-11 21:54:07,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 233 transitions, 1223 flow. Second operand has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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-11 21:54:07,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:07,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 195 [2022-12-11 21:54:07,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:07,494 INFO L130 PetriNetUnfolder]: 887/2620 cut-off events. [2022-12-11 21:54:07,494 INFO L131 PetriNetUnfolder]: For 3411/3737 co-relation queries the response was YES. [2022-12-11 21:54:07,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8692 conditions, 2620 events. 887/2620 cut-off events. For 3411/3737 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 19534 event pairs, 282 based on Foata normal form. 68/2461 useless extension candidates. Maximal degree in co-relation 6138. Up to 1359 conditions per place. [2022-12-11 21:54:07,511 INFO L137 encePairwiseOnDemand]: 187/195 looper letters, 150 selfloop transitions, 7 changer transitions 3/288 dead transitions. [2022-12-11 21:54:07,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 288 transitions, 2028 flow [2022-12-11 21:54:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 21:54:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 21:54:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1075 transitions. [2022-12-11 21:54:07,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7875457875457875 [2022-12-11 21:54:07,516 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 9 predicate places. [2022-12-11 21:54:07,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 288 transitions, 2028 flow [2022-12-11 21:54:07,529 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 285 transitions, 1998 flow [2022-12-11 21:54:07,529 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 285 transitions, 1998 flow [2022-12-11 21:54:07,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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-11 21:54:07,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:07,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:07,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 21:54:07,530 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:07,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:07,531 INFO L85 PathProgramCache]: Analyzing trace with hash 14045211, now seen corresponding path program 1 times [2022-12-11 21:54:07,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:07,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593548241] [2022-12-11 21:54:07,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:07,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:07,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:07,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593548241] [2022-12-11 21:54:07,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593548241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:54:07,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:54:07,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:54:07,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516938634] [2022-12-11 21:54:07,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:54:07,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:54:07,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:54:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:54:07,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 195 [2022-12-11 21:54:07,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 285 transitions, 1998 flow. Second operand has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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-11 21:54:07,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:07,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 195 [2022-12-11 21:54:07,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:08,085 INFO L130 PetriNetUnfolder]: 747/2160 cut-off events. [2022-12-11 21:54:08,085 INFO L131 PetriNetUnfolder]: For 4237/4861 co-relation queries the response was YES. [2022-12-11 21:54:08,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8398 conditions, 2160 events. 747/2160 cut-off events. For 4237/4861 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 15311 event pairs, 134 based on Foata normal form. 41/2001 useless extension candidates. Maximal degree in co-relation 7100. Up to 1136 conditions per place. [2022-12-11 21:54:08,098 INFO L137 encePairwiseOnDemand]: 187/195 looper letters, 159 selfloop transitions, 9 changer transitions 41/337 dead transitions. [2022-12-11 21:54:08,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 337 transitions, 3032 flow [2022-12-11 21:54:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 21:54:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 21:54:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1233 transitions. [2022-12-11 21:54:08,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7903846153846154 [2022-12-11 21:54:08,101 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 16 predicate places. [2022-12-11 21:54:08,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 337 transitions, 3032 flow [2022-12-11 21:54:08,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 296 transitions, 2456 flow [2022-12-11 21:54:08,112 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 296 transitions, 2456 flow [2022-12-11 21:54:08,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 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-11 21:54:08,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:08,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:08,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 21:54:08,113 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:08,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:08,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1475648231, now seen corresponding path program 1 times [2022-12-11 21:54:08,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:08,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497708740] [2022-12-11 21:54:08,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:08,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:08,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:08,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497708740] [2022-12-11 21:54:08,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497708740] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:54:08,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012649505] [2022-12-11 21:54:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:08,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:08,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:54:08,316 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-11 21:54:08,374 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-11 21:54:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:08,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-11 21:54:08,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:54:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:08,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:54:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:08,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012649505] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 21:54:08,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 21:54:08,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-11 21:54:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529990571] [2022-12-11 21:54:08,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 21:54:08,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-11 21:54:08,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:08,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-11 21:54:08,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-12-11 21:54:08,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 195 [2022-12-11 21:54:08,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 296 transitions, 2456 flow. Second operand has 19 states, 19 states have (on average 146.42105263157896) internal successors, (2782), 19 states have internal predecessors, (2782), 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-11 21:54:08,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:08,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 195 [2022-12-11 21:54:08,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:09,346 INFO L130 PetriNetUnfolder]: 818/2545 cut-off events. [2022-12-11 21:54:09,346 INFO L131 PetriNetUnfolder]: For 5725/6223 co-relation queries the response was YES. [2022-12-11 21:54:09,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10967 conditions, 2545 events. 818/2545 cut-off events. For 5725/6223 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 18955 event pairs, 111 based on Foata normal form. 128/2497 useless extension candidates. Maximal degree in co-relation 7733. Up to 1304 conditions per place. [2022-12-11 21:54:09,363 INFO L137 encePairwiseOnDemand]: 179/195 looper letters, 259 selfloop transitions, 36 changer transitions 22/444 dead transitions. [2022-12-11 21:54:09,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 444 transitions, 4982 flow [2022-12-11 21:54:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 21:54:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 21:54:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2087 transitions. [2022-12-11 21:54:09,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7644688644688644 [2022-12-11 21:54:09,367 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 25 predicate places. [2022-12-11 21:54:09,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 444 transitions, 4982 flow [2022-12-11 21:54:09,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 422 transitions, 4644 flow [2022-12-11 21:54:09,380 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 422 transitions, 4644 flow [2022-12-11 21:54:09,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 146.42105263157896) internal successors, (2782), 19 states have internal predecessors, (2782), 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-11 21:54:09,382 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:09,382 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:09,390 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-11 21:54:09,587 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-11 21:54:09,588 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:09,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash -335679904, now seen corresponding path program 1 times [2022-12-11 21:54:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:09,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426359613] [2022-12-11 21:54:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:09,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:09,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426359613] [2022-12-11 21:54:09,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426359613] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:54:09,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428074561] [2022-12-11 21:54:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:09,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:09,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:54:09,892 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-11 21:54:09,906 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-11 21:54:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:10,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-11 21:54:10,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:54:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:10,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:54:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:10,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428074561] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 21:54:10,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 21:54:10,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-11 21:54:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302688987] [2022-12-11 21:54:10,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 21:54:10,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-11 21:54:10,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:10,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-11 21:54:10,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-12-11 21:54:10,351 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 195 [2022-12-11 21:54:10,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 422 transitions, 4644 flow. Second operand has 19 states, 19 states have (on average 146.10526315789474) internal successors, (2776), 19 states have internal predecessors, (2776), 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-11 21:54:10,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:10,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 195 [2022-12-11 21:54:10,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:10,875 INFO L130 PetriNetUnfolder]: 676/2159 cut-off events. [2022-12-11 21:54:10,876 INFO L131 PetriNetUnfolder]: For 7436/9906 co-relation queries the response was YES. [2022-12-11 21:54:10,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10226 conditions, 2159 events. 676/2159 cut-off events. For 7436/9906 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15419 event pairs, 63 based on Foata normal form. 69/2070 useless extension candidates. Maximal degree in co-relation 8625. Up to 1079 conditions per place. [2022-12-11 21:54:10,889 INFO L137 encePairwiseOnDemand]: 181/195 looper letters, 215 selfloop transitions, 22 changer transitions 35/399 dead transitions. [2022-12-11 21:54:10,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 399 transitions, 4842 flow [2022-12-11 21:54:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 21:54:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 21:54:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2089 transitions. [2022-12-11 21:54:10,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7652014652014651 [2022-12-11 21:54:10,893 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 38 predicate places. [2022-12-11 21:54:10,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 399 transitions, 4842 flow [2022-12-11 21:54:10,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 364 transitions, 4216 flow [2022-12-11 21:54:10,905 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 364 transitions, 4216 flow [2022-12-11 21:54:10,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 146.10526315789474) internal successors, (2776), 19 states have internal predecessors, (2776), 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-11 21:54:10,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:10,906 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:10,928 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-11 21:54:11,112 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,SelfDestructingSolverStorable6 [2022-12-11 21:54:11,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:11,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:11,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2140475946, now seen corresponding path program 1 times [2022-12-11 21:54:11,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:11,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841685155] [2022-12-11 21:54:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:11,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:11,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:11,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841685155] [2022-12-11 21:54:11,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841685155] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:54:11,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734892165] [2022-12-11 21:54:11,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:11,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:11,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:54:11,322 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-11 21:54:11,324 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-11 21:54:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:11,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-11 21:54:11,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:54:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:11,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:54:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:11,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734892165] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 21:54:11,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 21:54:11,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-12-11 21:54:11,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197679659] [2022-12-11 21:54:11,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:54:11,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 21:54:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:11,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 21:54:11,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-12-11 21:54:11,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 195 [2022-12-11 21:54:11,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 364 transitions, 4216 flow. Second operand has 9 states, 9 states have (on average 147.22222222222223) internal successors, (1325), 9 states have internal predecessors, (1325), 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-11 21:54:11,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:11,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 195 [2022-12-11 21:54:11,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:12,073 INFO L130 PetriNetUnfolder]: 544/1619 cut-off events. [2022-12-11 21:54:12,073 INFO L131 PetriNetUnfolder]: For 5979/6435 co-relation queries the response was YES. [2022-12-11 21:54:12,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8787 conditions, 1619 events. 544/1619 cut-off events. For 5979/6435 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10413 event pairs, 60 based on Foata normal form. 68/1580 useless extension candidates. Maximal degree in co-relation 8163. Up to 845 conditions per place. [2022-12-11 21:54:12,085 INFO L137 encePairwiseOnDemand]: 185/195 looper letters, 225 selfloop transitions, 17 changer transitions 0/365 dead transitions. [2022-12-11 21:54:12,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 365 transitions, 4777 flow [2022-12-11 21:54:12,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:54:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:54:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1491 transitions. [2022-12-11 21:54:12,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7646153846153846 [2022-12-11 21:54:12,089 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 43 predicate places. [2022-12-11 21:54:12,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 212 places, 365 transitions, 4777 flow [2022-12-11 21:54:12,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 212 places, 365 transitions, 4777 flow [2022-12-11 21:54:12,100 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 365 transitions, 4777 flow [2022-12-11 21:54:12,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 147.22222222222223) internal successors, (1325), 9 states have internal predecessors, (1325), 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-11 21:54:12,101 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:12,101 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:12,119 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-11 21:54:12,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:12,307 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:12,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1516254086, now seen corresponding path program 2 times [2022-12-11 21:54:12,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:12,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070260022] [2022-12-11 21:54:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:12,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:12,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:12,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070260022] [2022-12-11 21:54:12,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070260022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:54:12,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918588106] [2022-12-11 21:54:12,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 21:54:12,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:12,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:54:12,555 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-11 21:54:12,558 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-11 21:54:12,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 21:54:12,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 21:54:12,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-11 21:54:12,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:54:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:12,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:54:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:12,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918588106] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 21:54:12,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 21:54:12,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-12-11 21:54:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387836897] [2022-12-11 21:54:12,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:54:12,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 21:54:12,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 21:54:12,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-12-11 21:54:12,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 195 [2022-12-11 21:54:12,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 365 transitions, 4777 flow. Second operand has 9 states, 9 states have (on average 147.22222222222223) internal successors, (1325), 9 states have internal predecessors, (1325), 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-11 21:54:12,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:12,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 195 [2022-12-11 21:54:12,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:13,265 INFO L130 PetriNetUnfolder]: 419/1219 cut-off events. [2022-12-11 21:54:13,265 INFO L131 PetriNetUnfolder]: For 5332/5628 co-relation queries the response was YES. [2022-12-11 21:54:13,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7370 conditions, 1219 events. 419/1219 cut-off events. For 5332/5628 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6923 event pairs, 30 based on Foata normal form. 37/1182 useless extension candidates. Maximal degree in co-relation 6897. Up to 648 conditions per place. [2022-12-11 21:54:13,274 INFO L137 encePairwiseOnDemand]: 183/195 looper letters, 209 selfloop transitions, 23 changer transitions 0/351 dead transitions. [2022-12-11 21:54:13,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 351 transitions, 4983 flow [2022-12-11 21:54:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:54:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:54:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1485 transitions. [2022-12-11 21:54:13,277 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7615384615384615 [2022-12-11 21:54:13,277 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 52 predicate places. [2022-12-11 21:54:13,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 351 transitions, 4983 flow [2022-12-11 21:54:13,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 351 transitions, 4983 flow [2022-12-11 21:54:13,286 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 351 transitions, 4983 flow [2022-12-11 21:54:13,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 147.22222222222223) internal successors, (1325), 9 states have internal predecessors, (1325), 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-11 21:54:13,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:13,287 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:13,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-11 21:54:13,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:13,495 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:13,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash -756248565, now seen corresponding path program 1 times [2022-12-11 21:54:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:13,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964682803] [2022-12-11 21:54:13,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:13,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:54:14,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:14,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964682803] [2022-12-11 21:54:14,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964682803] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:54:14,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139565733] [2022-12-11 21:54:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:14,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:14,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:54:14,382 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-11 21:54:14,421 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-11 21:54:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:14,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-11 21:54:14,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:54:14,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 21:54:14,792 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 16 treesize of output 18 [2022-12-11 21:54:14,856 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 19 treesize of output 7 [2022-12-11 21:54:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 21:54:14,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:54:15,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:54:15,222 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 48 treesize of output 34 [2022-12-11 21:54:15,225 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 13 treesize of output 9 [2022-12-11 21:54:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:54:15,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139565733] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 21:54:15,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 21:54:15,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 41 [2022-12-11 21:54:15,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705776096] [2022-12-11 21:54:15,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 21:54:15,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-11 21:54:15,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:15,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-11 21:54:15,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1498, Unknown=9, NotChecked=0, Total=1640 [2022-12-11 21:54:15,444 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 195 [2022-12-11 21:54:15,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 351 transitions, 4983 flow. Second operand has 41 states, 41 states have (on average 96.48780487804878) internal successors, (3956), 41 states have internal predecessors, (3956), 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-11 21:54:15,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:15,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 195 [2022-12-11 21:54:15,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:19,099 INFO L130 PetriNetUnfolder]: 4707/9349 cut-off events. [2022-12-11 21:54:19,099 INFO L131 PetriNetUnfolder]: For 55825/57687 co-relation queries the response was YES. [2022-12-11 21:54:19,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59442 conditions, 9349 events. 4707/9349 cut-off events. For 55825/57687 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 74789 event pairs, 488 based on Foata normal form. 85/8968 useless extension candidates. Maximal degree in co-relation 58358. Up to 4717 conditions per place. [2022-12-11 21:54:19,168 INFO L137 encePairwiseOnDemand]: 170/195 looper letters, 539 selfloop transitions, 152 changer transitions 16/781 dead transitions. [2022-12-11 21:54:19,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 781 transitions, 13831 flow [2022-12-11 21:54:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-11 21:54:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-11 21:54:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3496 transitions. [2022-12-11 21:54:19,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5273001508295626 [2022-12-11 21:54:19,175 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 85 predicate places. [2022-12-11 21:54:19,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 254 places, 781 transitions, 13831 flow [2022-12-11 21:54:19,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 765 transitions, 13500 flow [2022-12-11 21:54:19,236 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 765 transitions, 13500 flow [2022-12-11 21:54:19,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 96.48780487804878) internal successors, (3956), 41 states have internal predecessors, (3956), 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-11 21:54:19,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:19,238 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:19,268 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-11 21:54:19,445 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,SelfDestructingSolverStorable9 [2022-12-11 21:54:19,445 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:19,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1720391818, now seen corresponding path program 1 times [2022-12-11 21:54:19,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:19,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902829919] [2022-12-11 21:54:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:54:20,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:20,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902829919] [2022-12-11 21:54:20,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902829919] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:54:20,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017672520] [2022-12-11 21:54:20,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:20,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:20,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:54:20,363 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-11 21:54:20,365 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-11 21:54:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:20,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-11 21:54:20,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:54:20,620 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 19 treesize of output 7 [2022-12-11 21:54:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 21:54:20,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:54:20,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:54:20,880 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 20 treesize of output 16 [2022-12-11 21:54:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:54:20,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017672520] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 21:54:20,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 21:54:20,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 24 [2022-12-11 21:54:20,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094457604] [2022-12-11 21:54:20,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 21:54:20,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-11 21:54:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:20,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-11 21:54:20,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-12-11 21:54:20,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 195 [2022-12-11 21:54:20,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 765 transitions, 13500 flow. Second operand has 24 states, 24 states have (on average 104.625) internal successors, (2511), 24 states have internal predecessors, (2511), 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-11 21:54:20,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:20,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 195 [2022-12-11 21:54:20,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:24,260 INFO L130 PetriNetUnfolder]: 6747/13392 cut-off events. [2022-12-11 21:54:24,260 INFO L131 PetriNetUnfolder]: For 84461/86405 co-relation queries the response was YES. [2022-12-11 21:54:24,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94281 conditions, 13392 events. 6747/13392 cut-off events. For 84461/86405 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 115001 event pairs, 549 based on Foata normal form. 143/12813 useless extension candidates. Maximal degree in co-relation 92613. Up to 6761 conditions per place. [2022-12-11 21:54:24,375 INFO L137 encePairwiseOnDemand]: 172/195 looper letters, 871 selfloop transitions, 162 changer transitions 15/1137 dead transitions. [2022-12-11 21:54:24,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 1137 transitions, 22938 flow [2022-12-11 21:54:24,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-11 21:54:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-11 21:54:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3082 transitions. [2022-12-11 21:54:24,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5644688644688645 [2022-12-11 21:54:24,381 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 110 predicate places. [2022-12-11 21:54:24,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 1137 transitions, 22938 flow [2022-12-11 21:54:24,468 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 277 places, 1122 transitions, 22602 flow [2022-12-11 21:54:24,469 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 1122 transitions, 22602 flow [2022-12-11 21:54:24,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 104.625) internal successors, (2511), 24 states have internal predecessors, (2511), 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-11 21:54:24,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:24,470 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:24,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-11 21:54:24,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:24,676 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash -764293095, now seen corresponding path program 2 times [2022-12-11 21:54:24,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:24,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027755197] [2022-12-11 21:54:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:24,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:54:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:25,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027755197] [2022-12-11 21:54:25,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027755197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:54:25,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959675038] [2022-12-11 21:54:25,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 21:54:25,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:25,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:54:25,376 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:54:25,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-11 21:54:25,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 21:54:25,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 21:54:25,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-11 21:54:25,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:54:25,803 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 19 treesize of output 7 [2022-12-11 21:54:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:54:25,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:54:26,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:54:26,087 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 26 treesize of output 21 [2022-12-11 21:54:26,096 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-11 21:54:26,096 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 25 treesize of output 12 [2022-12-11 21:54:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:54:26,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959675038] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 21:54:26,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 21:54:26,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 10] total 29 [2022-12-11 21:54:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364165254] [2022-12-11 21:54:26,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 21:54:26,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-11 21:54:26,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:26,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-11 21:54:26,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2022-12-11 21:54:26,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 195 [2022-12-11 21:54:26,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 1122 transitions, 22602 flow. Second operand has 29 states, 29 states have (on average 103.03448275862068) internal successors, (2988), 29 states have internal predecessors, (2988), 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-11 21:54:26,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:26,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 195 [2022-12-11 21:54:26,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:33,288 INFO L130 PetriNetUnfolder]: 15055/29736 cut-off events. [2022-12-11 21:54:33,289 INFO L131 PetriNetUnfolder]: For 208474/212504 co-relation queries the response was YES. [2022-12-11 21:54:33,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230520 conditions, 29736 events. 15055/29736 cut-off events. For 208474/212504 co-relation queries the response was YES. Maximal size of possible extension queue 1367. Compared 286692 event pairs, 1016 based on Foata normal form. 250/28378 useless extension candidates. Maximal degree in co-relation 113524. Up to 15077 conditions per place. [2022-12-11 21:54:33,632 INFO L137 encePairwiseOnDemand]: 170/195 looper letters, 2107 selfloop transitions, 201 changer transitions 38/2434 dead transitions. [2022-12-11 21:54:33,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 2434 transitions, 55670 flow [2022-12-11 21:54:33,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-11 21:54:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-11 21:54:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 4304 transitions. [2022-12-11 21:54:33,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5517948717948717 [2022-12-11 21:54:33,639 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 147 predicate places. [2022-12-11 21:54:33,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 316 places, 2434 transitions, 55670 flow [2022-12-11 21:54:33,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 2396 transitions, 54724 flow [2022-12-11 21:54:33,907 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 2396 transitions, 54724 flow [2022-12-11 21:54:33,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 103.03448275862068) internal successors, (2988), 29 states have internal predecessors, (2988), 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-11 21:54:33,908 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:33,908 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:33,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-11 21:54:34,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:34,114 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:34,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1412452658, now seen corresponding path program 1 times [2022-12-11 21:54:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:34,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67627805] [2022-12-11 21:54:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:54:35,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:35,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67627805] [2022-12-11 21:54:35,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67627805] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:54:35,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183742351] [2022-12-11 21:54:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:35,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:54:35,072 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:54:35,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-11 21:54:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:35,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-11 21:54:35,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:54:35,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 21:54:35,508 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 16 treesize of output 18 [2022-12-11 21:54:35,554 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 19 treesize of output 7 [2022-12-11 21:54:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 21:54:35,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:54:35,796 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_478 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_478) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_478 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_478) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-12-11 21:54:35,820 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_478 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_478) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_478 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_478) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-12-11 21:54:35,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:54:35,828 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 60 treesize of output 45 [2022-12-11 21:54:35,831 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 19 treesize of output 12 [2022-12-11 21:54:35,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 21:54:35,846 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-11 21:54:35,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-12-11 21:54:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:54:36,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183742351] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 21:54:36,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 21:54:36,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 42 [2022-12-11 21:54:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447575414] [2022-12-11 21:54:36,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 21:54:36,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-11 21:54:36,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:36,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-11 21:54:36,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1416, Unknown=2, NotChecked=154, Total=1722 [2022-12-11 21:54:36,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 195 [2022-12-11 21:54:36,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 2396 transitions, 54724 flow. Second operand has 42 states, 42 states have (on average 96.5) internal successors, (4053), 42 states have internal predecessors, (4053), 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-11 21:54:36,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:36,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 195 [2022-12-11 21:54:36,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:46,590 INFO L130 PetriNetUnfolder]: 16463/32362 cut-off events. [2022-12-11 21:54:46,591 INFO L131 PetriNetUnfolder]: For 271108/277612 co-relation queries the response was YES. [2022-12-11 21:54:46,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275005 conditions, 32362 events. 16463/32362 cut-off events. For 271108/277612 co-relation queries the response was YES. Maximal size of possible extension queue 1493. Compared 314895 event pairs, 939 based on Foata normal form. 425/31078 useless extension candidates. Maximal degree in co-relation 135549. Up to 18048 conditions per place. [2022-12-11 21:54:46,926 INFO L137 encePairwiseOnDemand]: 164/195 looper letters, 2288 selfloop transitions, 324 changer transitions 38/2724 dead transitions. [2022-12-11 21:54:46,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 2724 transitions, 67512 flow [2022-12-11 21:54:46,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-11 21:54:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-11 21:54:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2739 transitions. [2022-12-11 21:54:46,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5202279202279202 [2022-12-11 21:54:46,930 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 169 predicate places. [2022-12-11 21:54:46,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 338 places, 2724 transitions, 67512 flow [2022-12-11 21:54:47,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 336 places, 2686 transitions, 66490 flow [2022-12-11 21:54:47,192 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 2686 transitions, 66490 flow [2022-12-11 21:54:47,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 96.5) internal successors, (4053), 42 states have internal predecessors, (4053), 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-11 21:54:47,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:47,194 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:47,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-11 21:54:47,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-11 21:54:47,401 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:54:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:54:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash 370232561, now seen corresponding path program 3 times [2022-12-11 21:54:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:54:47,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301614682] [2022-12-11 21:54:47,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:54:47,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:54:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:54:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:54:47,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:54:47,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301614682] [2022-12-11 21:54:47,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301614682] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:54:47,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515669241] [2022-12-11 21:54:47,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 21:54:47,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:54:47,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:54:47,968 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:54:47,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-11 21:54:48,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-11 21:54:48,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 21:54:48,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-11 21:54:48,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:54:48,306 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 19 treesize of output 7 [2022-12-11 21:54:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:54:48,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:54:48,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:54:48,518 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 26 treesize of output 21 [2022-12-11 21:54:48,525 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-11 21:54:48,526 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 25 treesize of output 12 [2022-12-11 21:54:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:54:48,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515669241] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 21:54:48,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 21:54:48,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 22 [2022-12-11 21:54:48,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119862401] [2022-12-11 21:54:48,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 21:54:48,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-11 21:54:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:54:48,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-11 21:54:48,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-12-11 21:54:48,606 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 195 [2022-12-11 21:54:48,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 2686 transitions, 66490 flow. Second operand has 22 states, 22 states have (on average 110.31818181818181) internal successors, (2427), 22 states have internal predecessors, (2427), 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-11 21:54:48,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:54:48,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 195 [2022-12-11 21:54:48,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:54:59,275 INFO L130 PetriNetUnfolder]: 17657/34646 cut-off events. [2022-12-11 21:54:59,276 INFO L131 PetriNetUnfolder]: For 322863/330115 co-relation queries the response was YES. [2022-12-11 21:54:59,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318863 conditions, 34646 events. 17657/34646 cut-off events. For 322863/330115 co-relation queries the response was YES. Maximal size of possible extension queue 1617. Compared 340502 event pairs, 947 based on Foata normal form. 386/33243 useless extension candidates. Maximal degree in co-relation 157161. Up to 21146 conditions per place. [2022-12-11 21:54:59,643 INFO L137 encePairwiseOnDemand]: 175/195 looper letters, 2525 selfloop transitions, 234 changer transitions 38/2906 dead transitions. [2022-12-11 21:54:59,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 2906 transitions, 77686 flow [2022-12-11 21:54:59,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 21:54:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 21:54:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2181 transitions. [2022-12-11 21:54:59,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.588663967611336 [2022-12-11 21:54:59,646 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 185 predicate places. [2022-12-11 21:54:59,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 354 places, 2906 transitions, 77686 flow [2022-12-11 21:54:59,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 352 places, 2868 transitions, 76588 flow [2022-12-11 21:54:59,947 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 2868 transitions, 76588 flow [2022-12-11 21:54:59,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 110.31818181818181) internal successors, (2427), 22 states have internal predecessors, (2427), 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-11 21:54:59,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:54:59,948 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:54:59,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-11 21:55:00,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-11 21:55:00,154 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:55:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:55:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1630172095, now seen corresponding path program 4 times [2022-12-11 21:55:00,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:55:00,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940724512] [2022-12-11 21:55:00,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:55:00,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:55:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:55:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:55:01,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:55:01,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940724512] [2022-12-11 21:55:01,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940724512] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:55:01,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927410987] [2022-12-11 21:55:01,045 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 21:55:01,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:55:01,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:55:01,060 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:55:01,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-11 21:55:01,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 21:55:01,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 21:55:01,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-11 21:55:01,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:55:01,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-11 21:55:01,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 21:55:01,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 21:55:01,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 21:55:01,953 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 16 treesize of output 18 [2022-12-11 21:55:02,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 21:55:02,021 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 16 treesize of output 18 [2022-12-11 21:55:02,081 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 15 treesize of output 7 [2022-12-11 21:55:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:55:02,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:55:02,320 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_580 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_580) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_580 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_580) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))))) is different from false [2022-12-11 21:55:02,427 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_579) |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_580) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_579) |c_thread1Thread1of1ForFork1_~#t3~0.base| v_ArrVal_580) c_~X_0~0.base) .cse0))))) is different from false [2022-12-11 21:55:02,442 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread1Thread1of1ForFork1_~#t3~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork1_~#t3~0.base_35|)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_579) |v_thread1Thread1of1ForFork1_~#t3~0.base_35| v_ArrVal_580) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))))) (forall ((|v_thread1Thread1of1ForFork1_~#t3~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork1_~#t3~0.base_35|)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_579) |v_thread1Thread1of1ForFork1_~#t3~0.base_35| v_ArrVal_580) c_~X_0~0.base) .cse0))))))) is different from false [2022-12-11 21:55:02,458 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread1Thread1of1ForFork1_~#t3~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork1_~#t3~0.base_35|)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_579) |v_thread1Thread1of1ForFork1_~#t3~0.base_35| v_ArrVal_580) c_~X_0~0.base) .cse0) (+ c_~s_6~0 c_~t_8~0 1))))) (forall ((|v_thread1Thread1of1ForFork1_~#t3~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork1_~#t3~0.base_35|)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_579) |v_thread1Thread1of1ForFork1_~#t3~0.base_35| v_ArrVal_580) c_~X_0~0.base) .cse0))))))) is different from false [2022-12-11 21:55:02,473 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread1Thread1of1ForFork1_~#t3~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork1_~#t3~0.base_35|)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_579) |v_thread1Thread1of1ForFork1_~#t3~0.base_35| v_ArrVal_580) c_~X_0~0.base) .cse0) (+ c_~s_6~0 .cse1 1))))) (forall ((|v_thread1Thread1of1ForFork1_~#t3~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork1_~#t3~0.base_35|)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (<= (+ c_~s_6~0 .cse1) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_579) |v_thread1Thread1of1ForFork1_~#t3~0.base_35| v_ArrVal_580) c_~X_0~0.base) .cse0))))))) is different from false [2022-12-11 21:55:02,534 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (let ((.cse1 (select (select |c_#memory_int| c_~X_0~0.base) .cse0))) (and (forall ((|v_thread1Thread1of1ForFork1_~#t3~0.base_35| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_579) |v_thread1Thread1of1ForFork1_~#t3~0.base_35| v_ArrVal_580) c_~X_0~0.base) .cse0) (+ .cse1 1))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork1_~#t3~0.base_35|)))) (forall ((|v_thread1Thread1of1ForFork1_~#t3~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork1_~#t3~0.base_35|)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (<= .cse1 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_579) |v_thread1Thread1of1ForFork1_~#t3~0.base_35| v_ArrVal_580) c_~X_0~0.base) .cse0)))))))) is different from false [2022-12-11 21:55:18,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:55:18,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 46 [2022-12-11 21:55:18,360 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 1298 treesize of output 1190 [2022-12-11 21:55:18,385 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 1162 treesize of output 1098 [2022-12-11 21:55:18,394 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 1098 treesize of output 970 [2022-12-11 21:55:18,400 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 970 treesize of output 842 [2022-12-11 21:55:18,412 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 842 treesize of output 770 [2022-12-11 21:55:19,532 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-11 21:55:19,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 1 [2022-12-11 21:55:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 6 times theorem prover too weak. 3 trivial. 1 not checked. [2022-12-11 21:55:21,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927410987] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 21:55:21,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 21:55:21,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26, 22] total 54 [2022-12-11 21:55:21,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515966554] [2022-12-11 21:55:21,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 21:55:21,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-11 21:55:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:55:21,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-11 21:55:21,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2028, Unknown=32, NotChecked=582, Total=2862 [2022-12-11 21:55:21,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 195 [2022-12-11 21:55:21,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 2868 transitions, 76588 flow. Second operand has 54 states, 54 states have (on average 90.25925925925925) internal successors, (4874), 54 states have internal predecessors, (4874), 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-11 21:55:21,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:55:21,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 195 [2022-12-11 21:55:21,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:55:51,405 INFO L130 PetriNetUnfolder]: 35527/67252 cut-off events. [2022-12-11 21:55:51,406 INFO L131 PetriNetUnfolder]: For 769170/789330 co-relation queries the response was YES. [2022-12-11 21:55:51,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681910 conditions, 67252 events. 35527/67252 cut-off events. For 769170/789330 co-relation queries the response was YES. Maximal size of possible extension queue 3325. Compared 702849 event pairs, 1446 based on Foata normal form. 992/65051 useless extension candidates. Maximal degree in co-relation 338368. Up to 43398 conditions per place. [2022-12-11 21:55:52,335 INFO L137 encePairwiseOnDemand]: 154/195 looper letters, 5391 selfloop transitions, 1290 changer transitions 70/6823 dead transitions. [2022-12-11 21:55:52,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 6823 transitions, 195250 flow [2022-12-11 21:55:52,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-11 21:55:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-11 21:55:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 4090 transitions. [2022-12-11 21:55:52,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4993894993894994 [2022-12-11 21:55:52,339 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 224 predicate places. [2022-12-11 21:55:52,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 393 places, 6823 transitions, 195250 flow [2022-12-11 21:55:52,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 391 places, 6753 transitions, 193022 flow [2022-12-11 21:55:52,988 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 6753 transitions, 193022 flow [2022-12-11 21:55:52,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 90.25925925925925) internal successors, (4874), 54 states have internal predecessors, (4874), 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-11 21:55:52,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:55:52,990 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:55:52,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-11 21:55:53,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-11 21:55:53,196 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:55:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:55:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash -765351781, now seen corresponding path program 5 times [2022-12-11 21:55:53,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:55:53,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62772228] [2022-12-11 21:55:53,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:55:53,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:55:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:55:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:55:54,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:55:54,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62772228] [2022-12-11 21:55:54,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62772228] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:55:54,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272979999] [2022-12-11 21:55:54,036 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-11 21:55:54,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:55:54,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:55:54,038 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:55:54,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-11 21:55:54,179 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-11 21:55:54,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 21:55:54,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-11 21:55:54,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:55:54,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 21:55:54,337 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 21:55:54,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-11 21:55:54,457 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 16 treesize of output 18 [2022-12-11 21:55:54,489 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 19 treesize of output 7 [2022-12-11 21:55:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:55:54,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:55:54,826 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_630 (Array Int Int))) (<= c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_630) c_~X_0~0.base) .cse0))) (forall ((v_ArrVal_630 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_630) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))))) is different from false [2022-12-11 21:55:54,832 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_630 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_630) c_~X_0~0.base) .cse0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_630 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0.base| v_ArrVal_630) c_~X_0~0.base) .cse0))))) is different from false [2022-12-11 21:55:54,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:55:54,838 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 48 treesize of output 34 [2022-12-11 21:55:54,840 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 13 treesize of output 9 [2022-12-11 21:55:54,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 21:55:54,851 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-11 21:55:54,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2022-12-11 21:55:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:55:55,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272979999] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 21:55:55,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 21:55:55,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2022-12-11 21:55:55,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846401098] [2022-12-11 21:55:55,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 21:55:55,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-11 21:55:55,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:55:55,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-11 21:55:55,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1221, Unknown=16, NotChecked=142, Total=1482 [2022-12-11 21:55:55,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 195 [2022-12-11 21:55:55,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 6753 transitions, 193022 flow. Second operand has 39 states, 39 states have (on average 94.17948717948718) internal successors, (3673), 39 states have internal predecessors, (3673), 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-11 21:55:55,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:55:55,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 195 [2022-12-11 21:55:55,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:57:22,583 INFO L130 PetriNetUnfolder]: 44863/84939 cut-off events. [2022-12-11 21:57:22,583 INFO L131 PetriNetUnfolder]: For 1083437/1102155 co-relation queries the response was YES. [2022-12-11 21:57:22,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920651 conditions, 84939 events. 44863/84939 cut-off events. For 1083437/1102155 co-relation queries the response was YES. Maximal size of possible extension queue 4192. Compared 911327 event pairs, 1267 based on Foata normal form. 1123/81838 useless extension candidates. Maximal degree in co-relation 457569. Up to 55280 conditions per place. [2022-12-11 21:57:23,759 INFO L137 encePairwiseOnDemand]: 158/195 looper letters, 7830 selfloop transitions, 1268 changer transitions 46/9238 dead transitions. [2022-12-11 21:57:23,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 9238 transitions, 279078 flow [2022-12-11 21:57:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-11 21:57:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-11 21:57:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3953 transitions. [2022-12-11 21:57:23,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5197896120973045 [2022-12-11 21:57:23,763 INFO L295 CegarLoopForPetriNet]: 169 programPoint places, 260 predicate places. [2022-12-11 21:57:23,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 9238 transitions, 279078 flow [2022-12-11 21:57:24,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 427 places, 9192 transitions, 277556 flow [2022-12-11 21:57:24,670 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 9192 transitions, 277556 flow [2022-12-11 21:57:24,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 94.17948717948718) internal successors, (3673), 39 states have internal predecessors, (3673), 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-11 21:57:24,671 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:57:24,671 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:57:24,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-11 21:57:24,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-11 21:57:24,879 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-11 21:57:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:57:24,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1270358011, now seen corresponding path program 6 times [2022-12-11 21:57:24,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:57:24,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74310965] [2022-12-11 21:57:24,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:57:24,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:57:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:57:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 21:57:25,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:57:25,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74310965] [2022-12-11 21:57:25,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74310965] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:57:25,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570713099] [2022-12-11 21:57:25,778 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-11 21:57:25,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:57:25,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:57:25,791 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:57:25,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-11 21:57:25,915 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-11 21:57:25,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 21:57:25,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-11 21:57:25,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:57:26,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-11 21:57:26,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 21:57:26,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 21:57:26,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 21:57:26,823 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-11 21:57:26,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 21:57:26,889 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-11 21:57:26,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:57:26,947 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 21 treesize of output 17 [2022-12-11 21:57:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:57:27,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:57:47,202 WARN L233 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 21:58:10,883 WARN L233 SmtUtils]: Spent 8.76s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 21:58:36,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:58:36,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 48 [2022-12-11 21:58:36,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:58:36,297 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 12086 treesize of output 10880 [2022-12-11 21:58:36,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:58:36,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10870 treesize of output 9088 [2022-12-11 21:58:36,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 21:58:36,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9078 treesize of output 8192 [2022-12-11 21:58:36,428 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 8182 treesize of output 7158 [2022-12-11 21:58:36,464 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 7158 treesize of output 6646 Received shutdown request... [2022-12-11 22:08:12,021 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 22:08:12,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-11 22:08:12,053 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-11 22:08:12,056 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-11 22:08:12,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-11 22:08:12,227 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-12-11 22:08:12,229 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2022-12-11 22:08:12,229 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 22:08:12,229 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 22:08:12,229 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 22:08:12,229 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 22:08:12,229 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2022-12-11 22:08:12,229 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:08:12,234 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 22:08:12,234 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 22:08:12,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 10:08:12 BasicIcfg [2022-12-11 22:08:12,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 22:08:12,239 INFO L158 Benchmark]: Toolchain (without parser) took 848453.41ms. Allocated memory was 224.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 200.1MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2022-12-11 22:08:12,239 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 224.4MB. Free memory is still 201.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 22:08:12,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.90ms. Allocated memory is still 224.4MB. Free memory was 199.7MB in the beginning and 185.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-11 22:08:12,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.83ms. Allocated memory is still 224.4MB. Free memory was 185.5MB in the beginning and 182.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 22:08:12,240 INFO L158 Benchmark]: Boogie Preprocessor took 43.76ms. Allocated memory is still 224.4MB. Free memory was 182.9MB in the beginning and 180.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 22:08:12,241 INFO L158 Benchmark]: RCFGBuilder took 642.65ms. Allocated memory is still 224.4MB. Free memory was 180.8MB in the beginning and 140.6MB in the end (delta: 40.3MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-12-11 22:08:12,241 INFO L158 Benchmark]: TraceAbstraction took 847543.96ms. Allocated memory was 224.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 139.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2022-12-11 22:08:12,242 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 224.4MB. Free memory is still 201.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.90ms. Allocated memory is still 224.4MB. Free memory was 199.7MB in the beginning and 185.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.83ms. Allocated memory is still 224.4MB. Free memory was 185.5MB in the beginning and 182.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.76ms. Allocated memory is still 224.4MB. Free memory was 182.9MB in the beginning and 180.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 642.65ms. Allocated memory is still 224.4MB. Free memory was 180.8MB in the beginning and 140.6MB in the end (delta: 40.3MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 847543.96ms. Allocated memory was 224.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 139.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 231 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 2.6s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 847.4s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 159.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 72 mSolverCounterUnknown, 4489 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4489 mSDsluCounter, 7414 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2463 IncrementalHoareTripleChecker+Unchecked, 6874 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19770 IncrementalHoareTripleChecker+Invalid, 22466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 540 mSDtfsCounter, 19770 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3858 GetRequests, 3252 SyntacticMatches, 38 SemanticMatches, 568 ConstructedPredicates, 10 IntricatePredicates, 4 DeprecatedPredicates, 6375 ImplicationChecksByTransitivity, 33.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277556occurred in iteration=16, InterpolantAutomatonStates: 306, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 9111 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 32.9s InterpolantComputationTime, 4128 NumberOfCodeBlocks, 4128 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5809 ConstructedInterpolants, 57 QuantifiedInterpolants, 29671 SizeOfPredicates, 256 NumberOfNonLiveVariables, 4833 ConjunctsInSsa, 499 ConjunctsInUnsatCore, 38 InterpolantComputations, 7 PerfectInterpolantSequences, 178/305 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown