/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:59:16,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:59:16,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:59:16,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:59:16,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:59:16,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:59:16,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:59:16,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:59:16,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:59:16,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:59:16,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:59:16,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:59:16,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:59:16,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:59:16,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:59:16,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:59:16,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:59:16,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:59:16,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:59:16,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:59:16,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:59:16,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:59:16,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:59:16,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:59:16,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:59:16,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:59:16,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:59:16,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:59:16,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:59:16,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:59:16,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:59:16,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:59:16,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:59:16,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:59:16,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:59:16,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:59:16,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:59:16,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:59:16,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:59:16,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:59:16,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:59:16,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 07:59:16,270 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:59:16,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:59:16,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:59:16,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:59:16,272 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:59:16,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:59:16,273 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:59:16,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:59:16,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:59:16,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:59:16,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:59:16,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:59:16,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:59:16,274 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:59:16,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:59:16,274 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:59:16,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:59:16,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:59:16,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:59:16,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:59:16,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:59:16,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:59:16,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:59:16,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:59:16,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:59:16,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:59:16,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:59:16,275 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:59:16,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:59:16,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:59:16,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:59:16,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:59:16,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:59:16,601 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:59:16,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2022-12-13 07:59:17,517 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:59:17,749 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:59:17,749 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2022-12-13 07:59:17,756 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32c14064/74ed2943f10a4b1eabeeb00c6f4b94fc/FLAG16701fb4e [2022-12-13 07:59:17,766 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32c14064/74ed2943f10a4b1eabeeb00c6f4b94fc [2022-12-13 07:59:17,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:59:17,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:59:17,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:59:17,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:59:17,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:59:17,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:59:17" (1/1) ... [2022-12-13 07:59:17,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519a1c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:17, skipping insertion in model container [2022-12-13 07:59:17,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:59:17" (1/1) ... [2022-12-13 07:59:17,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:59:17,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:59:17,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,946 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2022-12-13 07:59:17,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:59:17,967 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:59:17,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:59:17,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:59:17,994 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2022-12-13 07:59:17,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:59:18,006 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:59:18,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18 WrapperNode [2022-12-13 07:59:18,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:59:18,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:59:18,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:59:18,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:59:18,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (1/1) ... [2022-12-13 07:59:18,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (1/1) ... [2022-12-13 07:59:18,062 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 280 [2022-12-13 07:59:18,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:59:18,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:59:18,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:59:18,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:59:18,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (1/1) ... [2022-12-13 07:59:18,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (1/1) ... [2022-12-13 07:59:18,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (1/1) ... [2022-12-13 07:59:18,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (1/1) ... [2022-12-13 07:59:18,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (1/1) ... [2022-12-13 07:59:18,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (1/1) ... [2022-12-13 07:59:18,090 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (1/1) ... [2022-12-13 07:59:18,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (1/1) ... [2022-12-13 07:59:18,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:59:18,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:59:18,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:59:18,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:59:18,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (1/1) ... [2022-12-13 07:59:18,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:59:18,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:59:18,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 07:59:18,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 07:59:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:59:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:59:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:59:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:59:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:59:18,163 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:59:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:59:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:59:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:59:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:59:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:59:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 07:59:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 07:59:18,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 07:59:18,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:59:18,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:59:18,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:59:18,166 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 07:59:18,256 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:59:18,257 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:59:18,623 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:59:18,803 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:59:18,804 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 07:59:18,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:59:18 BoogieIcfgContainer [2022-12-13 07:59:18,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:59:18,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:59:18,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:59:18,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:59:18,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:59:17" (1/3) ... [2022-12-13 07:59:18,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365335a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:59:18, skipping insertion in model container [2022-12-13 07:59:18,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:18" (2/3) ... [2022-12-13 07:59:18,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365335a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:59:18, skipping insertion in model container [2022-12-13 07:59:18,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:59:18" (3/3) ... [2022-12-13 07:59:18,812 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2022-12-13 07:59:18,825 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:59:18,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:59:18,826 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:59:18,886 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 07:59:18,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 179 transitions, 382 flow [2022-12-13 07:59:19,005 INFO L130 PetriNetUnfolder]: 16/176 cut-off events. [2022-12-13 07:59:19,005 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:59:19,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 176 events. 16/176 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 108 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2022-12-13 07:59:19,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 179 transitions, 382 flow [2022-12-13 07:59:19,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 166 transitions, 350 flow [2022-12-13 07:59:19,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:59:19,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 166 transitions, 350 flow [2022-12-13 07:59:19,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 166 transitions, 350 flow [2022-12-13 07:59:19,067 INFO L130 PetriNetUnfolder]: 16/166 cut-off events. [2022-12-13 07:59:19,067 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:59:19,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 166 events. 16/166 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 107 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2022-12-13 07:59:19,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 166 transitions, 350 flow [2022-12-13 07:59:19,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 1518 [2022-12-13 07:59:24,328 INFO L241 LiptonReduction]: Total number of compositions: 138 [2022-12-13 07:59:24,338 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:59:24,343 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a238668, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:59:24,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 07:59:24,348 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2022-12-13 07:59:24,348 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:59:24,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:59:24,349 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] [2022-12-13 07:59:24,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:59:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:59:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash 597230375, now seen corresponding path program 1 times [2022-12-13 07:59:24,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:59:24,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88303176] [2022-12-13 07:59:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:59:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:24,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:59:24,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88303176] [2022-12-13 07:59:24,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88303176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:59:24,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:59:24,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 07:59:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638215469] [2022-12-13 07:59:24,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:59:24,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:59:24,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:59:24,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:59:24,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:59:24,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-13 07:59:24,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:24,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:59:24,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-13 07:59:24,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:59:24,943 INFO L130 PetriNetUnfolder]: 620/871 cut-off events. [2022-12-13 07:59:24,943 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 07:59:24,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 871 events. 620/871 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3409 event pairs, 95 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 1365. Up to 688 conditions per place. [2022-12-13 07:59:24,952 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 38 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2022-12-13 07:59:24,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 211 flow [2022-12-13 07:59:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:59:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:59:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-13 07:59:24,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-13 07:59:24,964 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2022-12-13 07:59:24,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 46 transitions, 211 flow [2022-12-13 07:59:24,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 45 transitions, 204 flow [2022-12-13 07:59:24,973 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:59:24,974 INFO L89 Accepts]: Start accepts. Operand has 35 places, 45 transitions, 204 flow [2022-12-13 07:59:24,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:59:24,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:59:24,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 45 transitions, 204 flow [2022-12-13 07:59:24,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 45 transitions, 204 flow [2022-12-13 07:59:24,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 07:59:24,982 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:59:24,985 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 07:59:24,988 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 45 transitions, 204 flow [2022-12-13 07:59:24,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:24,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:59:24,988 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:59:24,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:59:24,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:59:24,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:59:24,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1243665619, now seen corresponding path program 1 times [2022-12-13 07:59:24,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:59:24,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776558878] [2022-12-13 07:59:24,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:24,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:59:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:25,102 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-13 07:59:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:59:25,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776558878] [2022-12-13 07:59:25,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776558878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:59:25,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:59:25,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:59:25,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176332236] [2022-12-13 07:59:25,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:59:25,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:59:25,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:59:25,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:59:25,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:59:25,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 07:59:25,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 45 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:25,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:59:25,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 07:59:25,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:59:25,223 INFO L130 PetriNetUnfolder]: 643/924 cut-off events. [2022-12-13 07:59:25,223 INFO L131 PetriNetUnfolder]: For 86/106 co-relation queries the response was YES. [2022-12-13 07:59:25,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 924 events. 643/924 cut-off events. For 86/106 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3797 event pairs, 154 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 2117. Up to 911 conditions per place. [2022-12-13 07:59:25,228 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 41 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2022-12-13 07:59:25,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 308 flow [2022-12-13 07:59:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:59:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:59:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-13 07:59:25,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-13 07:59:25,230 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2022-12-13 07:59:25,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 48 transitions, 308 flow [2022-12-13 07:59:25,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 47 transitions, 302 flow [2022-12-13 07:59:25,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:59:25,237 INFO L89 Accepts]: Start accepts. Operand has 37 places, 47 transitions, 302 flow [2022-12-13 07:59:25,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:59:25,239 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:59:25,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 47 transitions, 302 flow [2022-12-13 07:59:25,241 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 47 transitions, 302 flow [2022-12-13 07:59:25,241 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 07:59:25,242 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:59:25,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 07:59:25,244 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 47 transitions, 302 flow [2022-12-13 07:59:25,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:25,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:59:25,244 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:59:25,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:59:25,245 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:59:25,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:59:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash -713380074, now seen corresponding path program 1 times [2022-12-13 07:59:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:59:25,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360725132] [2022-12-13 07:59:25,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:25,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:59:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:59:25,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:59:25,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360725132] [2022-12-13 07:59:25,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360725132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:59:25,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66418283] [2022-12-13 07:59:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:25,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:59:25,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:59:25,459 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-13 07:59:25,471 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-13 07:59:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:25,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:59:25,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:59:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:59:25,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:59:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:59:25,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66418283] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:59:25,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:59:25,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-12-13 07:59:25,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760119446] [2022-12-13 07:59:25,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:59:25,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:59:25,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:59:25,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:59:25,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:59:25,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-13 07:59:25,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 47 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:25,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:59:25,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-13 07:59:25,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:59:25,962 INFO L130 PetriNetUnfolder]: 895/1318 cut-off events. [2022-12-13 07:59:25,962 INFO L131 PetriNetUnfolder]: For 860/860 co-relation queries the response was YES. [2022-12-13 07:59:25,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4966 conditions, 1318 events. 895/1318 cut-off events. For 860/860 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4965 event pairs, 78 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 3720. Up to 1167 conditions per place. [2022-12-13 07:59:25,971 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 89 selfloop transitions, 19 changer transitions 0/109 dead transitions. [2022-12-13 07:59:25,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 109 transitions, 921 flow [2022-12-13 07:59:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:59:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:59:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-13 07:59:25,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-13 07:59:25,974 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2022-12-13 07:59:25,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 109 transitions, 921 flow [2022-12-13 07:59:25,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 109 transitions, 921 flow [2022-12-13 07:59:25,988 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:59:25,988 INFO L89 Accepts]: Start accepts. Operand has 44 places, 109 transitions, 921 flow [2022-12-13 07:59:25,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:59:25,990 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:59:25,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 109 transitions, 921 flow [2022-12-13 07:59:25,993 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 109 transitions, 921 flow [2022-12-13 07:59:25,993 INFO L226 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-13 07:59:27,220 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:59:27,221 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1233 [2022-12-13 07:59:27,221 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 107 transitions, 905 flow [2022-12-13 07:59:27,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:27,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:59:27,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:59:27,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 07:59:27,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:59:27,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:59:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:59:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1792574739, now seen corresponding path program 1 times [2022-12-13 07:59:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:59:27,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116751371] [2022-12-13 07:59:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:59:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:59:27,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:59:27,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116751371] [2022-12-13 07:59:27,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116751371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:59:27,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:59:27,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:59:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470196585] [2022-12-13 07:59:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:59:27,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:59:27,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:59:27,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:59:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:59:27,494 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 07:59:27,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 107 transitions, 905 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:27,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:59:27,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 07:59:27,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:59:27,662 INFO L130 PetriNetUnfolder]: 912/1321 cut-off events. [2022-12-13 07:59:27,662 INFO L131 PetriNetUnfolder]: For 1479/1533 co-relation queries the response was YES. [2022-12-13 07:59:27,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6214 conditions, 1321 events. 912/1321 cut-off events. For 1479/1533 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4915 event pairs, 72 based on Foata normal form. 8/1064 useless extension candidates. Maximal degree in co-relation 5870. Up to 1199 conditions per place. [2022-12-13 07:59:27,672 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 127 selfloop transitions, 10 changer transitions 0/141 dead transitions. [2022-12-13 07:59:27,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 141 transitions, 1448 flow [2022-12-13 07:59:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:59:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:59:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 07:59:27,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2022-12-13 07:59:27,674 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2022-12-13 07:59:27,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 141 transitions, 1448 flow [2022-12-13 07:59:27,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 141 transitions, 1448 flow [2022-12-13 07:59:27,685 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:59:27,685 INFO L89 Accepts]: Start accepts. Operand has 45 places, 141 transitions, 1448 flow [2022-12-13 07:59:27,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:59:27,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:59:27,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 141 transitions, 1448 flow [2022-12-13 07:59:27,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 141 transitions, 1448 flow [2022-12-13 07:59:27,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-13 07:59:27,690 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:59:27,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:59:27,692 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 141 transitions, 1448 flow [2022-12-13 07:59:27,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:27,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:59:27,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:59:27,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:59:27,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:59:27,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:59:27,693 INFO L85 PathProgramCache]: Analyzing trace with hash -652159167, now seen corresponding path program 1 times [2022-12-13 07:59:27,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:59:27,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917341578] [2022-12-13 07:59:27,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:27,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:59:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:29,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:29,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:59:29,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917341578] [2022-12-13 07:59:29,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917341578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:59:29,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126683574] [2022-12-13 07:59:29,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:29,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:59:29,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:59:29,255 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-13 07:59:29,257 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-13 07:59:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:29,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-13 07:59:29,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:59:29,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:59:29,613 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-13 07:59:29,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2022-12-13 07:59:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:29,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:59:29,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:59:29,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 94 [2022-12-13 07:59:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:29,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126683574] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:59:29,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:59:29,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 25 [2022-12-13 07:59:29,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402437102] [2022-12-13 07:59:29,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:59:29,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 07:59:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:59:29,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 07:59:29,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2022-12-13 07:59:29,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-13 07:59:29,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 141 transitions, 1448 flow. Second operand has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:29,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:59:29,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-13 07:59:29,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:59:32,267 INFO L130 PetriNetUnfolder]: 2203/3200 cut-off events. [2022-12-13 07:59:32,268 INFO L131 PetriNetUnfolder]: For 3955/4063 co-relation queries the response was YES. [2022-12-13 07:59:32,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18250 conditions, 3200 events. 2203/3200 cut-off events. For 3955/4063 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13760 event pairs, 44 based on Foata normal form. 39/2570 useless extension candidates. Maximal degree in co-relation 14640. Up to 2933 conditions per place. [2022-12-13 07:59:32,288 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 364 selfloop transitions, 113 changer transitions 17/496 dead transitions. [2022-12-13 07:59:32,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 496 transitions, 6085 flow [2022-12-13 07:59:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 07:59:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 07:59:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 263 transitions. [2022-12-13 07:59:32,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4083850931677019 [2022-12-13 07:59:32,291 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2022-12-13 07:59:32,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 496 transitions, 6085 flow [2022-12-13 07:59:32,306 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 479 transitions, 5851 flow [2022-12-13 07:59:32,320 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:59:32,321 INFO L89 Accepts]: Start accepts. Operand has 67 places, 479 transitions, 5851 flow [2022-12-13 07:59:32,323 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:59:32,324 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:59:32,324 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 479 transitions, 5851 flow [2022-12-13 07:59:32,330 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 479 transitions, 5851 flow [2022-12-13 07:59:32,330 INFO L226 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-13 07:59:37,473 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 07:59:37,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5155 [2022-12-13 07:59:37,475 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 476 transitions, 5815 flow [2022-12-13 07:59:37,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:37,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:59:37,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:59:37,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 07:59:37,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:59:37,685 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:59:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:59:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1418301370, now seen corresponding path program 1 times [2022-12-13 07:59:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:59:37,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224167277] [2022-12-13 07:59:37,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:59:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:38,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:59:38,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224167277] [2022-12-13 07:59:38,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224167277] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:59:38,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91905676] [2022-12-13 07:59:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:38,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:59:38,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:59:38,512 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-13 07:59:38,514 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-13 07:59:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:38,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-13 07:59:38,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:59:38,628 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 76 treesize of output 74 [2022-12-13 07:59:38,635 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 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 07:59:38,647 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 07:59:38,648 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 07:59:38,762 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-13 07:59:38,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:59:38,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-13 07:59:38,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:59:38,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-12-13 07:59:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:39,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:59:39,142 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_261 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~res1~0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1))))))) is different from false [2022-12-13 07:59:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 07:59:39,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91905676] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:59:39,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:59:39,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2022-12-13 07:59:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090130536] [2022-12-13 07:59:39,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:59:39,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:59:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:59:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:59:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=416, Unknown=6, NotChecked=42, Total=552 [2022-12-13 07:59:39,307 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 07:59:39,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 476 transitions, 5815 flow. Second operand has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 24 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:39,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:59:39,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 07:59:39,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:59:40,022 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((~M~0 Int) (v_ArrVal_261 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (let ((.cse0 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)) c_~res1~0)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261)) (.cse2 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2))))))) (not (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0))) (forall ((~M~0 Int) (v_ArrVal_261 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~res1~0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261)) (.cse4 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset)) (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse4)))))))) is different from false [2022-12-13 07:59:41,763 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((~M~0 Int) (v_ArrVal_261 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (let ((.cse0 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)) c_~res1~0)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261)) (.cse2 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2))))))) (not (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0))) (<= c_~N~0 1) (or (and (= c_~res2~0 c_~res1~0) (<= |c_thread3Thread1of1ForFork1_~i~2#1| c_~N~0)) (<= |c_thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 c_~N~0)) is different from false [2022-12-13 07:59:41,821 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~B~0.base)) (.cse0 (select |c_#memory_int| c_~A~0.base))) (and (or (forall ((~M~0 Int) (v_ArrVal_261 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (let ((.cse1 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ c_~B~0.offset .cse1)) c_~res1~0)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261)) (.cse4 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset)) (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse4))))))) (not (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0))) (or (= |c_thread3Thread1of1ForFork1_~tmp~2#1| c_~res1~0) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (or (= c_~res2~0 c_~res1~0) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0)) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (let ((.cse5 (* ~M~0 4))) (+ (select .cse2 (+ .cse5 c_~B~0.offset)) c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse5)))) c_~res1~0))))) is different from false [2022-12-13 07:59:43,727 INFO L130 PetriNetUnfolder]: 5854/8834 cut-off events. [2022-12-13 07:59:43,727 INFO L131 PetriNetUnfolder]: For 11939/12095 co-relation queries the response was YES. [2022-12-13 07:59:43,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59364 conditions, 8834 events. 5854/8834 cut-off events. For 11939/12095 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 50088 event pairs, 28 based on Foata normal form. 30/7026 useless extension candidates. Maximal degree in co-relation 49156. Up to 8136 conditions per place. [2022-12-13 07:59:43,771 INFO L137 encePairwiseOnDemand]: 11/31 looper letters, 972 selfloop transitions, 942 changer transitions 75/1991 dead transitions. [2022-12-13 07:59:43,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 1991 transitions, 28598 flow [2022-12-13 07:59:43,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 07:59:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-13 07:59:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 463 transitions. [2022-12-13 07:59:43,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34733683420855216 [2022-12-13 07:59:43,780 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 70 predicate places. [2022-12-13 07:59:43,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 1991 transitions, 28598 flow [2022-12-13 07:59:43,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 1916 transitions, 27485 flow [2022-12-13 07:59:43,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:59:43,856 INFO L89 Accepts]: Start accepts. Operand has 103 places, 1916 transitions, 27485 flow [2022-12-13 07:59:43,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:59:43,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:59:43,864 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 1916 transitions, 27485 flow [2022-12-13 07:59:43,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 1916 transitions, 27485 flow [2022-12-13 07:59:43,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-13 07:59:43,914 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:59:43,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-13 07:59:43,915 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 1916 transitions, 27485 flow [2022-12-13 07:59:43,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 24 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:43,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:59:43,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:59:43,938 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-13 07:59:44,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:59:44,138 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:59:44,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:59:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1624482768, now seen corresponding path program 2 times [2022-12-13 07:59:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:59:44,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533121439] [2022-12-13 07:59:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:59:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:44,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:59:44,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533121439] [2022-12-13 07:59:44,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533121439] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:59:44,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628923623] [2022-12-13 07:59:44,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:59:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:59:44,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:59:44,941 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-13 07:59:44,943 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-13 07:59:45,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:59:45,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:59:45,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 07:59:45,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:59:45,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:59:45,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:59:45,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:59:45,130 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 07:59:45,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-13 07:59:45,133 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 8 treesize of output 7 [2022-12-13 07:59:45,137 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 22 treesize of output 20 [2022-12-13 07:59:45,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:59:45,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:59:45,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-13 07:59:45,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:59:45,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-12-13 07:59:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:45,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:59:45,455 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int))) (= c_~res1~0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_348)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)))))) is different from false [2022-12-13 07:59:45,468 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int))) (= (let ((.cse0 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int| c_~B~0.base) (+ c_~B~0.offset .cse0)) c_~res1~0)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_348)) (.cse2 (* 4 c_~M~0))) (+ (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2)) c_~res2~0 (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)))))) is different from false [2022-12-13 07:59:45,473 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset) c_~res1~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_348)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)))))) is different from false [2022-12-13 07:59:45,482 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_347))) (= (+ (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_348)) (.cse2 (* 4 c_~M~0))) (+ (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2)) c_~res2~0 (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset))))))) is different from false [2022-12-13 07:59:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 07:59:45,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628923623] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:59:45,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:59:45,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-12-13 07:59:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446086905] [2022-12-13 07:59:45,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:59:45,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:59:45,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:59:45,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:59:45,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=321, Unknown=4, NotChecked=156, Total=552 [2022-12-13 07:59:45,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-13 07:59:45,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 1916 transitions, 27485 flow. Second operand has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:45,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:59:45,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-13 07:59:45,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:00:05,816 WARN L233 SmtUtils]: Spent 20.28s on a formula simplification. DAG size of input: 55 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:00:09,849 INFO L130 PetriNetUnfolder]: 9154/14174 cut-off events. [2022-12-13 08:00:09,849 INFO L131 PetriNetUnfolder]: For 22514/22724 co-relation queries the response was YES. [2022-12-13 08:00:09,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109376 conditions, 14174 events. 9154/14174 cut-off events. For 22514/22724 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 91272 event pairs, 30 based on Foata normal form. 21/11233 useless extension candidates. Maximal degree in co-relation 76998. Up to 13164 conditions per place. [2022-12-13 08:00:09,984 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 2647 selfloop transitions, 662 changer transitions 91/3402 dead transitions. [2022-12-13 08:00:09,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 3402 transitions, 55973 flow [2022-12-13 08:00:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:00:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 08:00:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 196 transitions. [2022-12-13 08:00:09,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 08:00:09,989 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 83 predicate places. [2022-12-13 08:00:09,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 3402 transitions, 55973 flow [2022-12-13 08:00:10,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 3311 transitions, 54403 flow [2022-12-13 08:00:10,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:00:10,184 INFO L89 Accepts]: Start accepts. Operand has 116 places, 3311 transitions, 54403 flow [2022-12-13 08:00:10,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:00:10,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:00:10,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 3311 transitions, 54403 flow [2022-12-13 08:00:10,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 3311 transitions, 54403 flow [2022-12-13 08:00:10,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 20 [2022-12-13 08:00:10,296 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:00:10,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 08:00:10,297 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 3311 transitions, 54403 flow [2022-12-13 08:00:10,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:10,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:00:10,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:00:10,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 08:00:10,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:00:10,507 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:00:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:00:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1447672580, now seen corresponding path program 3 times [2022-12-13 08:00:10,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:00:10,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467561059] [2022-12-13 08:00:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:00:10,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:00:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:00:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:00:11,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:00:11,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467561059] [2022-12-13 08:00:11,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467561059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:00:11,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225612125] [2022-12-13 08:00:11,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:00:11,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:00:11,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:00:11,465 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-13 08:00:11,512 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-13 08:00:11,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 08:00:11,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:00:11,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 08:00:11,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:00:11,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:00:11,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:00:11,807 INFO L321 Elim1Store]: treesize reduction 30, result has 55.2 percent of original size [2022-12-13 08:00:11,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 47 [2022-12-13 08:00:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:00:11,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:00:12,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:00:12,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 94 [2022-12-13 08:00:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:00:12,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225612125] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:00:12,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:00:12,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 7] total 20 [2022-12-13 08:00:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134571796] [2022-12-13 08:00:12,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:00:12,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 08:00:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:00:12,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 08:00:12,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2022-12-13 08:00:12,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 08:00:12,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 3311 transitions, 54403 flow. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:12,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:00:12,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 08:00:12,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:00:23,515 INFO L130 PetriNetUnfolder]: 14349/22768 cut-off events. [2022-12-13 08:00:23,515 INFO L131 PetriNetUnfolder]: For 20324/20324 co-relation queries the response was YES. [2022-12-13 08:00:23,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198934 conditions, 22768 events. 14349/22768 cut-off events. For 20324/20324 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 163468 event pairs, 52 based on Foata normal form. 16/17996 useless extension candidates. Maximal degree in co-relation 136759. Up to 21200 conditions per place. [2022-12-13 08:00:23,651 INFO L137 encePairwiseOnDemand]: 13/30 looper letters, 4015 selfloop transitions, 1661 changer transitions 139/5815 dead transitions. [2022-12-13 08:00:23,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 5815 transitions, 107056 flow [2022-12-13 08:00:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:00:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 08:00:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 401 transitions. [2022-12-13 08:00:23,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3819047619047619 [2022-12-13 08:00:23,653 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 117 predicate places. [2022-12-13 08:00:23,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 5815 transitions, 107056 flow [2022-12-13 08:00:23,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 5676 transitions, 104422 flow [2022-12-13 08:00:23,886 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:00:23,886 INFO L89 Accepts]: Start accepts. Operand has 150 places, 5676 transitions, 104422 flow [2022-12-13 08:00:23,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:00:23,907 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:00:23,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 5676 transitions, 104422 flow [2022-12-13 08:00:24,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 5676 transitions, 104422 flow [2022-12-13 08:00:24,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:00:24,030 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:00:24,031 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 08:00:24,031 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 5676 transitions, 104422 flow [2022-12-13 08:00:24,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:24,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:00:24,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:00:24,061 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-13 08:00:24,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:00:24,238 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:00:24,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:00:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash -71565702, now seen corresponding path program 4 times [2022-12-13 08:00:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:00:24,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724811689] [2022-12-13 08:00:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:00:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:00:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:00:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:00:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:00:24,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724811689] [2022-12-13 08:00:24,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724811689] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:00:24,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964699277] [2022-12-13 08:00:24,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:00:24,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:00:24,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:00:24,688 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-13 08:00:24,699 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-13 08:00:24,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:00:24,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:00:24,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 08:00:24,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:00:25,013 INFO L321 Elim1Store]: treesize reduction 28, result has 56.9 percent of original size [2022-12-13 08:00:25,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 47 [2022-12-13 08:00:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:00:25,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:00:25,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:00:25,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 94 [2022-12-13 08:00:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:00:25,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964699277] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:00:25,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:00:25,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 20 [2022-12-13 08:00:25,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787490754] [2022-12-13 08:00:25,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:00:25,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 08:00:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:00:25,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 08:00:25,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-12-13 08:00:25,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 08:00:25,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 5676 transitions, 104422 flow. Second operand has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:25,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:00:25,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 08:00:25,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:00:50,743 INFO L130 PetriNetUnfolder]: 20211/32237 cut-off events. [2022-12-13 08:00:50,743 INFO L131 PetriNetUnfolder]: For 30084/30084 co-relation queries the response was YES. [2022-12-13 08:00:50,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315688 conditions, 32237 events. 20211/32237 cut-off events. For 30084/30084 co-relation queries the response was YES. Maximal size of possible extension queue 1584. Compared 247823 event pairs, 49 based on Foata normal form. 32/26020 useless extension candidates. Maximal degree in co-relation 215149. Up to 30191 conditions per place. [2022-12-13 08:00:50,930 INFO L137 encePairwiseOnDemand]: 15/30 looper letters, 6935 selfloop transitions, 1554 changer transitions 280/8769 dead transitions. [2022-12-13 08:00:50,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 8769 transitions, 178893 flow [2022-12-13 08:00:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-13 08:00:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-13 08:00:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 500 transitions. [2022-12-13 08:00:50,933 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32679738562091504 [2022-12-13 08:00:50,934 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 167 predicate places. [2022-12-13 08:00:50,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 8769 transitions, 178893 flow [2022-12-13 08:00:51,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 8489 transitions, 173005 flow [2022-12-13 08:00:51,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:00:51,436 INFO L89 Accepts]: Start accepts. Operand has 199 places, 8489 transitions, 173005 flow [2022-12-13 08:00:51,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:00:51,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:00:51,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 8489 transitions, 173005 flow [2022-12-13 08:00:51,671 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 8489 transitions, 173005 flow [2022-12-13 08:00:51,671 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:00:51,689 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:00:51,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-13 08:00:51,691 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 8489 transitions, 173005 flow [2022-12-13 08:00:51,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:51,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:00:51,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:00:51,697 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-13 08:00:51,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:00:51,897 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:00:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:00:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash -205705252, now seen corresponding path program 5 times [2022-12-13 08:00:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:00:51,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864512805] [2022-12-13 08:00:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:00:51,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:00:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:00:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:00:52,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:00:52,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864512805] [2022-12-13 08:00:52,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864512805] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:00:52,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27704720] [2022-12-13 08:00:52,384 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:00:52,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:00:52,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:00:52,404 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-13 08:00:52,407 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-13 08:00:52,504 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:00:52,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:00:52,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 84 conjunts are in the unsatisfiable core [2022-12-13 08:00:52,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:00:52,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:00:52,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:00:52,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-13 08:00:52,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:00:52,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-12-13 08:00:52,543 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 22 treesize of output 20 [2022-12-13 08:00:52,547 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 8 treesize of output 7 [2022-12-13 08:00:52,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:00:52,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 08:00:52,556 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 8 treesize of output 7 [2022-12-13 08:00:52,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:00:52,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:00:52,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:00:52,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-12-13 08:00:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:00:52,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:00:54,805 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_589 (Array Int Int)) (~M~0 Int) (v_ArrVal_590 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590))) (let ((.cse0 (select .cse3 c_~B~0.base)) (.cse2 (select .cse3 c_~A~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 c_~B~0.offset)) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1)))) (+ (select .cse0 c_~B~0.offset) (select .cse2 c_~A~0.offset) c_~res1~0)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-12-13 08:00:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:00:54,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27704720] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:00:54,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:00:54,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 24 [2022-12-13 08:00:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53164744] [2022-12-13 08:00:54,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:00:54,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 08:00:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:00:54,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 08:00:54,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=498, Unknown=6, NotChecked=46, Total=650 [2022-12-13 08:00:54,822 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 08:00:54,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 8489 transitions, 173005 flow. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:54,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:00:54,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 08:00:54,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:00:57,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:01:51,956 INFO L130 PetriNetUnfolder]: 23784/37914 cut-off events. [2022-12-13 08:01:51,957 INFO L131 PetriNetUnfolder]: For 33523/33523 co-relation queries the response was YES. [2022-12-13 08:01:52,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408201 conditions, 37914 events. 23784/37914 cut-off events. For 33523/33523 co-relation queries the response was YES. Maximal size of possible extension queue 1872. Compared 298194 event pairs, 53 based on Foata normal form. 12/30778 useless extension candidates. Maximal degree in co-relation 276670. Up to 35222 conditions per place. [2022-12-13 08:01:52,214 INFO L137 encePairwiseOnDemand]: 12/30 looper letters, 7690 selfloop transitions, 3054 changer transitions 79/10823 dead transitions. [2022-12-13 08:01:52,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 10823 transitions, 241285 flow [2022-12-13 08:01:52,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 08:01:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 08:01:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 369 transitions. [2022-12-13 08:01:52,217 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36176470588235293 [2022-12-13 08:01:52,217 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 199 predicate places. [2022-12-13 08:01:52,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 10823 transitions, 241285 flow [2022-12-13 08:01:52,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 10744 transitions, 239499 flow [2022-12-13 08:01:52,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:01:52,737 INFO L89 Accepts]: Start accepts. Operand has 232 places, 10744 transitions, 239499 flow [2022-12-13 08:01:52,792 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:01:52,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:01:52,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 10744 transitions, 239499 flow [2022-12-13 08:01:53,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 10744 transitions, 239499 flow [2022-12-13 08:01:53,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:01:53,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [755] $Ultimate##0-->L48-4: Formula: (= |v_thread1Thread1of1ForFork2_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0#1] and [837] L98-3-->L99-3: Formula: (and (= |v_#pthreadsForks_31| |v_ULTIMATE.start_main_#t~pre22#1_15|) (= |v_#pthreadsForks_30| (+ |v_#pthreadsForks_31| 1)) (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_13| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_13|) |v_ULTIMATE.start_main_~#t2~0#1.offset_13| |v_ULTIMATE.start_main_#t~pre22#1_15|)) |v_#memory_int_80|)) InVars {#pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_13|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_13|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_11|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_13|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet21#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-13 08:01:53,326 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:01:53,327 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 590 [2022-12-13 08:01:53,327 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 10743 transitions, 239483 flow [2022-12-13 08:01:53,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:01:53,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:01:53,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:01:53,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 08:01:53,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:01:53,533 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:01:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:01:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1994295414, now seen corresponding path program 6 times [2022-12-13 08:01:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:01:53,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783698682] [2022-12-13 08:01:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:01:53,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:01:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:01:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:01:54,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:01:54,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783698682] [2022-12-13 08:01:54,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783698682] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:01:54,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118446104] [2022-12-13 08:01:54,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:01:54,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:01:54,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:01:54,462 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-13 08:01:54,487 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-13 08:01:54,614 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 08:01:54,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:01:54,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 08:01:54,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:01:54,833 INFO L321 Elim1Store]: treesize reduction 28, result has 56.9 percent of original size [2022-12-13 08:01:54,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 47 [2022-12-13 08:01:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:01:54,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:01:55,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:01:55,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 82 [2022-12-13 08:01:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:01:55,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118446104] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:01:55,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:01:55,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 23 [2022-12-13 08:01:55,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646742240] [2022-12-13 08:01:55,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:01:55,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 08:01:55,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:01:55,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 08:01:55,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-12-13 08:01:55,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 08:01:55,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 10743 transitions, 239483 flow. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:01:55,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:01:55,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 08:01:55,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:03:06,119 INFO L130 PetriNetUnfolder]: 27492/43892 cut-off events. [2022-12-13 08:03:06,119 INFO L131 PetriNetUnfolder]: For 36936/36936 co-relation queries the response was YES. [2022-12-13 08:03:06,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516033 conditions, 43892 events. 27492/43892 cut-off events. For 36936/36936 co-relation queries the response was YES. Maximal size of possible extension queue 2285. Compared 354411 event pairs, 47 based on Foata normal form. 16/35900 useless extension candidates. Maximal degree in co-relation 301009. Up to 40853 conditions per place. [2022-12-13 08:03:06,402 INFO L137 encePairwiseOnDemand]: 16/32 looper letters, 10754 selfloop transitions, 2211 changer transitions 100/13065 dead transitions. [2022-12-13 08:03:06,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 13065 transitions, 316793 flow [2022-12-13 08:03:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 08:03:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-13 08:03:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 369 transitions. [2022-12-13 08:03:06,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27455357142857145 [2022-12-13 08:03:06,404 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 236 predicate places. [2022-12-13 08:03:06,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 269 places, 13065 transitions, 316793 flow [2022-12-13 08:03:06,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 269 places, 12965 transitions, 314276 flow [2022-12-13 08:03:07,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:03:07,078 INFO L89 Accepts]: Start accepts. Operand has 269 places, 12965 transitions, 314276 flow [2022-12-13 08:03:07,129 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:03:07,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:03:07,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 12965 transitions, 314276 flow [2022-12-13 08:03:07,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 12965 transitions, 314276 flow [2022-12-13 08:03:07,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:03:07,652 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:03:07,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 576 [2022-12-13 08:03:07,653 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 12965 transitions, 314276 flow [2022-12-13 08:03:07,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:03:07,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:03:07,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:03:07,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 08:03:07,857 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,SelfDestructingSolverStorable10 [2022-12-13 08:03:07,858 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:03:07,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:03:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1065325847, now seen corresponding path program 1 times [2022-12-13 08:03:07,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:03:07,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74637423] [2022-12-13 08:03:07,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:03:07,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:03:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:03:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:03:07,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:03:07,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74637423] [2022-12-13 08:03:07,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74637423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:03:07,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:03:07,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:03:07,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860042188] [2022-12-13 08:03:07,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:03:07,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:03:07,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:03:07,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:03:07,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:03:07,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2022-12-13 08:03:07,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 12965 transitions, 314276 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:03:07,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:03:07,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2022-12-13 08:03:07,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:05:15,173 INFO L130 PetriNetUnfolder]: 27111/43693 cut-off events. [2022-12-13 08:05:15,173 INFO L131 PetriNetUnfolder]: For 55279/55279 co-relation queries the response was YES. [2022-12-13 08:05:15,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554015 conditions, 43693 events. 27111/43693 cut-off events. For 55279/55279 co-relation queries the response was YES. Maximal size of possible extension queue 2314. Compared 357621 event pairs, 66 based on Foata normal form. 0/35686 useless extension candidates. Maximal degree in co-relation 408567. Up to 40571 conditions per place. [2022-12-13 08:05:15,655 INFO L137 encePairwiseOnDemand]: 30/32 looper letters, 12393 selfloop transitions, 1 changer transitions 32/12795 dead transitions. [2022-12-13 08:05:15,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 12795 transitions, 335927 flow [2022-12-13 08:05:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:05:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 08:05:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 08:05:15,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-13 08:05:15,657 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 226 predicate places. [2022-12-13 08:05:15,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 12795 transitions, 335927 flow [2022-12-13 08:05:16,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 12763 transitions, 335065 flow [2022-12-13 08:05:16,384 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:05:16,384 INFO L89 Accepts]: Start accepts. Operand has 259 places, 12763 transitions, 335065 flow [2022-12-13 08:05:16,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:05:16,550 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:05:16,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 12763 transitions, 335065 flow [2022-12-13 08:05:17,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 12763 transitions, 335065 flow [2022-12-13 08:05:17,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:05:17,241 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:05:17,241 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 857 [2022-12-13 08:05:17,242 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 12763 transitions, 335065 flow [2022-12-13 08:05:17,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:05:17,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:05:17,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:05:17,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 08:05:17,242 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:05:17,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:05:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2126970212, now seen corresponding path program 7 times [2022-12-13 08:05:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:05:17,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994560693] [2022-12-13 08:05:17,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:05:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:05:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:05:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:05:18,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:05:18,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994560693] [2022-12-13 08:05:18,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994560693] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:05:18,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190004677] [2022-12-13 08:05:18,196 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 08:05:18,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:05:18,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:05:18,198 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-13 08:05:18,206 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-13 08:05:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:05:18,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-13 08:05:18,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:05:18,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:05:18,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:05:18,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-13 08:05:18,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:05:18,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-12-13 08:05:18,553 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 22 treesize of output 20 [2022-12-13 08:05:18,558 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 8 treesize of output 7 [2022-12-13 08:05:18,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:05:18,679 INFO L217 Elim1Store]: Index analysis took 117 ms [2022-12-13 08:05:18,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 08:05:18,700 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 8 treesize of output 7 [2022-12-13 08:05:18,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:05:18,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-13 08:05:18,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:05:18,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-13 08:05:19,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:05:19,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-12-13 08:05:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:05:19,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:05:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:05:19,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190004677] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:05:19,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:05:19,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-13 08:05:19,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548491368] [2022-12-13 08:05:19,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:05:19,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 08:05:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:05:19,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 08:05:19,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=789, Unknown=18, NotChecked=0, Total=930 [2022-12-13 08:05:19,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 08:05:19,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 12763 transitions, 335065 flow. Second operand has 31 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:05:19,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:05:19,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 08:05:19,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:05:34,579 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 91 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:05:36,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:05:36,706 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~res1~0 1)) (.cse9 (select |c_#memory_int| c_~B~0.base)) (.cse10 (select |c_#memory_int| c_~A~0.base))) (and (forall ((~M~0 Int) (v_ArrVal_786 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (< (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_786)) (.cse1 (* ~M~0 4))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) .cse2))) (or (not (< 0 c_~N~0)) (let ((.cse5 (select .cse10 c_~A~0.offset)) (.cse6 (select .cse9 c_~B~0.offset))) (and (forall ((~M~0 Int) (v_ArrVal_786 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (< (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_786)) (.cse4 (* ~M~0 4))) (+ (select (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset)) c_~res2~0 (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse4)))) (+ .cse5 .cse6 c_~res1~0 1)))) (forall ((~M~0 Int) (v_ArrVal_786 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (<= (+ .cse5 .cse6 c_~res1~0) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_786)) (.cse8 (* ~M~0 4))) (+ (select (select .cse7 c_~B~0.base) (+ .cse8 c_~B~0.offset)) c_~res2~0 (select (select .cse7 c_~A~0.base) (+ c_~A~0.offset .cse8)))))))))) (forall ((~M~0 Int) (v_ArrVal_786 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (< (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_786)) (.cse12 (* ~M~0 4))) (+ (select (select .cse11 c_~A~0.base) (+ c_~A~0.offset .cse12)) (select (select .cse11 c_~B~0.base) (+ .cse12 c_~B~0.offset)) c_~res2~0)) .cse2))) (= c_~res2~0 c_~res1~0) (or (let ((.cse19 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse13 (select .cse10 (+ c_~A~0.offset .cse19))) (.cse14 (select .cse9 (+ c_~B~0.offset .cse19)))) (and (forall ((~M~0 Int) (v_ArrVal_786 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (<= (+ .cse13 .cse14 c_~res1~0) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_786)) (.cse16 (* ~M~0 4))) (+ (select (select .cse15 c_~B~0.base) (+ .cse16 c_~B~0.offset)) c_~res2~0 (select (select .cse15 c_~A~0.base) (+ c_~A~0.offset .cse16))))))) (forall ((~M~0 Int) (v_ArrVal_786 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (< (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_786)) (.cse18 (* ~M~0 4))) (+ (select (select .cse17 c_~B~0.base) (+ .cse18 c_~B~0.offset)) c_~res2~0 (select (select .cse17 c_~A~0.base) (+ c_~A~0.offset .cse18)))) (+ .cse13 .cse14 c_~res1~0 1))))))) (not (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0))) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (< (let ((.cse20 (* ~M~0 4))) (+ (select .cse9 (+ .cse20 c_~B~0.offset)) c_~res2~0 (select .cse10 (+ c_~A~0.offset .cse20)))) .cse2))) (forall ((~M~0 Int) (v_ArrVal_786 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (<= c_~res1~0 (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_786)) (.cse22 (* ~M~0 4))) (+ (select (select .cse21 c_~B~0.base) (+ .cse22 c_~B~0.offset)) c_~res2~0 (select (select .cse21 c_~A~0.base) (+ c_~A~0.offset .cse22))))))) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (<= c_~res1~0 (let ((.cse23 (* ~M~0 4))) (+ (select .cse9 (+ .cse23 c_~B~0.offset)) c_~res2~0 (select .cse10 (+ c_~A~0.offset .cse23))))))) (forall ((~M~0 Int) (v_ArrVal_786 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (<= c_~res1~0 (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_786)) (.cse25 (* ~M~0 4))) (+ (select (select .cse24 c_~A~0.base) (+ c_~A~0.offset .cse25)) (select (select .cse24 c_~B~0.base) (+ .cse25 c_~B~0.offset)) c_~res2~0))))))) is different from false [2022-12-13 08:08:11,455 INFO L130 PetriNetUnfolder]: 29861/48110 cut-off events. [2022-12-13 08:08:11,456 INFO L131 PetriNetUnfolder]: For 53292/53292 co-relation queries the response was YES. [2022-12-13 08:08:11,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658096 conditions, 48110 events. 29861/48110 cut-off events. For 53292/53292 co-relation queries the response was YES. Maximal size of possible extension queue 2576. Compared 399268 event pairs, 62 based on Foata normal form. 16/39403 useless extension candidates. Maximal degree in co-relation 485868. Up to 44630 conditions per place. [2022-12-13 08:08:11,913 INFO L137 encePairwiseOnDemand]: 10/29 looper letters, 10644 selfloop transitions, 4104 changer transitions 148/14896 dead transitions. [2022-12-13 08:08:11,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 14896 transitions, 420596 flow [2022-12-13 08:08:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 08:08:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 08:08:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 304 transitions. [2022-12-13 08:08:11,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34942528735632183 [2022-12-13 08:08:11,914 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 255 predicate places. [2022-12-13 08:08:11,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 288 places, 14896 transitions, 420596 flow [2022-12-13 08:08:12,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 14748 transitions, 416295 flow [2022-12-13 08:08:12,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:08:12,654 INFO L89 Accepts]: Start accepts. Operand has 288 places, 14748 transitions, 416295 flow [2022-12-13 08:08:12,757 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:08:12,757 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:08:12,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 14748 transitions, 416295 flow [2022-12-13 08:08:13,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 14748 transitions, 416295 flow [2022-12-13 08:08:13,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:08:17,146 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:08:17,146 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4493 [2022-12-13 08:08:17,146 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 14747 transitions, 416267 flow [2022-12-13 08:08:17,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:08:17,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:08:17,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:08:17,154 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-13 08:08:17,357 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,SelfDestructingSolverStorable12 [2022-12-13 08:08:17,357 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:08:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:08:17,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1029689250, now seen corresponding path program 8 times [2022-12-13 08:08:17,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:08:17,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148114224] [2022-12-13 08:08:17,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:08:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:08:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:08:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:08:18,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:08:18,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148114224] [2022-12-13 08:08:18,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148114224] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:08:18,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175918945] [2022-12-13 08:08:18,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:08:18,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:08:18,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:08:18,280 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-13 08:08:18,283 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-13 08:08:18,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:08:18,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:08:18,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-13 08:08:18,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:08:18,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:08:18,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:08:18,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-13 08:08:18,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:08:18,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-12-13 08:08:18,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:08:18,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:08:18,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:08:18,432 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 10 treesize of output 8 [2022-12-13 08:08:18,437 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 8 treesize of output 7 [2022-12-13 08:08:18,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:08:18,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 08:08:18,445 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 8 treesize of output 7 [2022-12-13 08:08:18,505 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-13 08:08:18,567 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-13 08:08:18,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:08:18,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-12-13 08:08:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:08:18,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:08:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:08:18,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175918945] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:08:18,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:08:18,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2022-12-13 08:08:18,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772209227] [2022-12-13 08:08:18,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:08:18,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 08:08:18,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:08:18,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 08:08:18,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=546, Unknown=6, NotChecked=0, Total=650 [2022-12-13 08:08:18,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 08:08:18,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 14747 transitions, 416267 flow. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:08:18,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:08:18,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 08:08:18,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:11:15,395 INFO L130 PetriNetUnfolder]: 31466/50918 cut-off events. [2022-12-13 08:11:15,396 INFO L131 PetriNetUnfolder]: For 50773/50773 co-relation queries the response was YES. [2022-12-13 08:11:15,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747648 conditions, 50918 events. 31466/50918 cut-off events. For 50773/50773 co-relation queries the response was YES. Maximal size of possible extension queue 2720. Compared 428432 event pairs, 54 based on Foata normal form. 12/41598 useless extension candidates. Maximal degree in co-relation 559208. Up to 47322 conditions per place. [2022-12-13 08:11:15,860 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 13136 selfloop transitions, 2631 changer transitions 51/15818 dead transitions. [2022-12-13 08:11:15,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 15818 transitions, 478254 flow [2022-12-13 08:11:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 08:11:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 08:11:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 264 transitions. [2022-12-13 08:11:15,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-13 08:11:15,862 INFO L295 CegarLoopForPetriNet]: 33 programPoint places, 281 predicate places. [2022-12-13 08:11:15,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 314 places, 15818 transitions, 478254 flow [2022-12-13 08:11:16,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 314 places, 15767 transitions, 476652 flow [2022-12-13 08:11:16,904 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:11:16,904 INFO L89 Accepts]: Start accepts. Operand has 314 places, 15767 transitions, 476652 flow [2022-12-13 08:11:16,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:11:16,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:11:16,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 314 places, 15767 transitions, 476652 flow [2022-12-13 08:11:17,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 314 places, 15767 transitions, 476652 flow [2022-12-13 08:11:17,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:11:17,680 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:11:17,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 776 [2022-12-13 08:11:17,681 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 15767 transitions, 476652 flow [2022-12-13 08:11:17,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:11:17,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:11:17,681 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:11:17,688 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-13 08:11:17,885 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,SelfDestructingSolverStorable13 [2022-12-13 08:11:17,886 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:11:17,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:11:17,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2016814984, now seen corresponding path program 9 times [2022-12-13 08:11:17,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:11:17,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737415661] [2022-12-13 08:11:17,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:11:17,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:11:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:11:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:11:18,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:11:18,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737415661] [2022-12-13 08:11:18,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737415661] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:11:18,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812198472] [2022-12-13 08:11:18,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:11:18,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:11:18,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:11:18,926 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-13 08:11:18,928 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-13 08:11:19,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 08:11:19,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:11:19,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 08:11:19,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:11:19,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:11:19,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:11:19,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:11:19,099 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 08:11:19,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-13 08:11:19,105 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 8 treesize of output 7 [2022-12-13 08:11:19,109 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 22 treesize of output 20 [2022-12-13 08:11:19,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:11:19,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:11:19,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:11:19,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-12-13 08:11:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:11:19,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:11:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:11:19,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812198472] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:11:19,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:11:19,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2022-12-13 08:11:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447295012] [2022-12-13 08:11:19,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:11:19,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 08:11:19,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:11:19,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 08:11:19,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=610, Unknown=4, NotChecked=0, Total=702 [2022-12-13 08:11:19,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 08:11:19,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 15767 transitions, 476652 flow. Second operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:11:19,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:11:19,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 08:11:19,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 08:13:27,100 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:13:27,100 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-13 08:13:27,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 08:13:27,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 08:13:27,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 08:13:27,372 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,SelfDestructingSolverStorable14 [2022-12-13 08:13:27,372 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (27states, 0/30 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 509587 conditions, 32867 events (21586/32866 cut-off events. For 46750/46750 co-relation queries the response was YES. Maximal size of possible extension queue 2818. Compared 262220 event pairs, 31 based on Foata normal form. 0/28659 useless extension candidates. Maximal degree in co-relation 420826. Up to 29684 conditions per place.). [2022-12-13 08:13:27,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 08:13:27,374 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 08:13:27,374 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 08:13:27,374 INFO L445 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1] [2022-12-13 08:13:27,376 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:13:27,376 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:13:27,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:13:27 BasicIcfg [2022-12-13 08:13:27,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:13:27,378 INFO L158 Benchmark]: Toolchain (without parser) took 849609.26ms. Allocated memory was 187.7MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 163.1MB in the beginning and 348.6MB in the end (delta: -185.5MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-13 08:13:27,378 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 163.7MB in the beginning and 163.6MB in the end (delta: 83.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:13:27,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.94ms. Allocated memory is still 187.7MB. Free memory was 162.6MB in the beginning and 149.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 08:13:27,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.00ms. Allocated memory is still 187.7MB. Free memory was 149.5MB in the beginning and 146.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 08:13:27,379 INFO L158 Benchmark]: Boogie Preprocessor took 43.80ms. Allocated memory is still 187.7MB. Free memory was 146.8MB in the beginning and 144.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:13:27,379 INFO L158 Benchmark]: RCFGBuilder took 699.13ms. Allocated memory is still 187.7MB. Free memory was 144.8MB in the beginning and 86.6MB in the end (delta: 58.2MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. [2022-12-13 08:13:27,379 INFO L158 Benchmark]: TraceAbstraction took 848569.23ms. Allocated memory was 187.7MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 85.5MB in the beginning and 348.6MB in the end (delta: -263.1MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-13 08:13:27,380 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.09ms. Allocated memory is still 187.7MB. Free memory was 163.7MB in the beginning and 163.6MB in the end (delta: 83.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.94ms. Allocated memory is still 187.7MB. Free memory was 162.6MB in the beginning and 149.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.00ms. Allocated memory is still 187.7MB. Free memory was 149.5MB in the beginning and 146.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.80ms. Allocated memory is still 187.7MB. Free memory was 146.8MB in the beginning and 144.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 699.13ms. Allocated memory is still 187.7MB. Free memory was 144.8MB in the beginning and 86.6MB in the end (delta: 58.2MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. * TraceAbstraction took 848569.23ms. Allocated memory was 187.7MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 85.5MB in the beginning and 348.6MB in the end (delta: -263.1MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 160 PlacesBefore, 33 PlacesAfterwards, 166 TransitionsBefore, 28 TransitionsAfterwards, 1518 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 96 TrivialYvCompositions, 31 ConcurrentYvCompositions, 11 ChoiceCompositions, 138 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 838, independent: 820, independent conditional: 820, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 838, independent: 820, independent conditional: 0, independent unconditional: 820, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 838, independent: 820, independent conditional: 0, independent unconditional: 820, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 838, independent: 820, independent conditional: 0, independent unconditional: 820, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 791, independent: 779, independent conditional: 0, independent unconditional: 779, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 791, independent: 779, independent conditional: 0, independent unconditional: 779, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 838, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 791, unknown conditional: 0, unknown unconditional: 791] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1250, Positive conditional cache size: 0, Positive unconditional cache size: 1250, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 44 PlacesBefore, 42 PlacesAfterwards, 109 TransitionsBefore, 107 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 67 PlacesBefore, 64 PlacesAfterwards, 479 TransitionsBefore, 476 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 1916 TransitionsBefore, 1916 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 116 PlacesBefore, 116 PlacesAfterwards, 3311 TransitionsBefore, 3311 TransitionsAfterwards, 20 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 150 PlacesBefore, 150 PlacesAfterwards, 5676 TransitionsBefore, 5676 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 199 PlacesBefore, 199 PlacesAfterwards, 8489 TransitionsBefore, 8489 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 232 PlacesBefore, 231 PlacesAfterwards, 10744 TransitionsBefore, 10743 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 269 PlacesBefore, 269 PlacesAfterwards, 12965 TransitionsBefore, 12965 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 259 PlacesBefore, 259 PlacesAfterwards, 12763 TransitionsBefore, 12763 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 288 PlacesBefore, 287 PlacesAfterwards, 14748 TransitionsBefore, 14747 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 314 PlacesBefore, 314 PlacesAfterwards, 15767 TransitionsBefore, 15767 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (27states, 0/30 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 509587 conditions, 32867 events (21586/32866 cut-off events. For 46750/46750 co-relation queries the response was YES. Maximal size of possible extension queue 2818. Compared 262220 event pairs, 31 based on Foata normal form. 0/28659 useless extension candidates. Maximal degree in co-relation 420826. Up to 29684 conditions per place.). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (27states, 0/30 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 509587 conditions, 32867 events (21586/32866 cut-off events. For 46750/46750 co-relation queries the response was YES. Maximal size of possible extension queue 2818. Compared 262220 event pairs, 31 based on Foata normal form. 0/28659 useless extension candidates. Maximal degree in co-relation 420826. Up to 29684 conditions per place.). - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (27states, 0/30 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 509587 conditions, 32867 events (21586/32866 cut-off events. For 46750/46750 co-relation queries the response was YES. Maximal size of possible extension queue 2818. Compared 262220 event pairs, 31 based on Foata normal form. 0/28659 useless extension candidates. Maximal degree in co-relation 420826. Up to 29684 conditions per place.). - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (27states, 0/30 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 509587 conditions, 32867 events (21586/32866 cut-off events. For 46750/46750 co-relation queries the response was YES. Maximal size of possible extension queue 2818. Compared 262220 event pairs, 31 based on Foata normal form. 0/28659 useless extension candidates. Maximal degree in co-relation 420826. Up to 29684 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 197 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 848.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 801.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 130 mSolverCounterUnknown, 3545 SdHoareTripleChecker+Valid, 16.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3545 mSDsluCounter, 1104 SdHoareTripleChecker+Invalid, 14.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 824 IncrementalHoareTripleChecker+Unchecked, 988 mSDsCounter, 364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15496 IncrementalHoareTripleChecker+Invalid, 16814 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 364 mSolverCounterUnsat, 116 mSDtfsCounter, 15496 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 840 GetRequests, 329 SyntacticMatches, 19 SemanticMatches, 492 ConstructedPredicates, 10 IntricatePredicates, 2 DeprecatedPredicates, 6093 ImplicationChecksByTransitivity, 51.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=476652occurred in iteration=14, InterpolantAutomatonStates: 322, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 789 ConstructedInterpolants, 63 QuantifiedInterpolants, 15588 SizeOfPredicates, 313 NumberOfNonLiveVariables, 3075 ConjunctsInSsa, 715 ConjunctsInUnsatCore, 37 InterpolantComputations, 5 PerfectInterpolantSequences, 10/72 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