/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-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 08:33:55,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 08:33:55,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 08:33:55,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 08:33:55,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 08:33:55,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 08:33:55,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 08:33:55,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 08:33:55,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 08:33:55,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 08:33:55,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 08:33:55,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 08:33:55,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 08:33:55,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 08:33:55,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 08:33:55,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 08:33:55,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 08:33:55,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 08:33:55,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 08:33:55,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 08:33:55,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 08:33:55,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 08:33:55,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 08:33:55,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 08:33:55,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 08:33:55,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 08:33:55,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 08:33:55,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 08:33:55,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 08:33:55,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 08:33:55,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 08:33:55,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 08:33:55,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 08:33:55,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 08:33:55,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 08:33:55,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 08:33:55,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 08:33:55,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 08:33:55,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 08:33:55,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 08:33:55,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 08:33:55,322 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 08:33:55,345 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 08:33:55,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 08:33:55,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 08:33:55,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 08:33:55,347 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 08:33:55,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 08:33:55,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 08:33:55,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 08:33:55,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 08:33:55,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 08:33:55,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 08:33:55,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 08:33:55,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 08:33:55,349 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 08:33:55,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 08:33:55,349 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 08:33:55,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 08:33:55,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 08:33:55,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 08:33:55,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 08:33:55,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 08:33:55,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:33:55,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 08:33:55,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 08:33:55,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 08:33:55,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 08:33:55,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 08:33:55,350 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 08:33:55,350 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 08:33:55,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 08:33:55,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 08:33:55,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 08:33:55,649 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 08:33:55,654 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 08:33:55,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-12-13 08:33:56,536 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 08:33:56,737 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 08:33:56,737 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-12-13 08:33:56,741 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1db454b/1c702331602e4e7189af0fae0beeab43/FLAG2c5326de6 [2022-12-13 08:33:56,750 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1db454b/1c702331602e4e7189af0fae0beeab43 [2022-12-13 08:33:56,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 08:33:56,753 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 08:33:56,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 08:33:56,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 08:33:56,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 08:33:56,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:56,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf758e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56, skipping insertion in model container [2022-12-13 08:33:56,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:56,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 08:33:56,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 08:33:56,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:33:56,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:33:56,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:33:56,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:33:56,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:33:56,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:33:56,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:33:56,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:33:56,891 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-two-queue.wvr.c[2987,3000] [2022-12-13 08:33:56,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:33:56,910 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 08:33:56,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:33:56,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:33:56,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:33:56,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:33:56,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:33:56,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:33:56,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:33:56,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:33:56,940 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-two-queue.wvr.c[2987,3000] [2022-12-13 08:33:56,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:33:56,956 INFO L208 MainTranslator]: Completed translation [2022-12-13 08:33:56,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56 WrapperNode [2022-12-13 08:33:56,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 08:33:56,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 08:33:56,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 08:33:56,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 08:33:56,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:56,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:57,000 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 200 [2022-12-13 08:33:57,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 08:33:57,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 08:33:57,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 08:33:57,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 08:33:57,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:57,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:57,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:57,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:57,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:57,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:57,036 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:57,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:57,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 08:33:57,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 08:33:57,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 08:33:57,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 08:33:57,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (1/1) ... [2022-12-13 08:33:57,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:33:57,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:33:57,093 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 08:33:57,105 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 08:33:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 08:33:57,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 08:33:57,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 08:33:57,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 08:33:57,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 08:33:57,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 08:33:57,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 08:33:57,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 08:33:57,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 08:33:57,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 08:33:57,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 08:33:57,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 08:33:57,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 08:33:57,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 08:33:57,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 08:33:57,142 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 08:33:57,243 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 08:33:57,245 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 08:33:57,585 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 08:33:57,695 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 08:33:57,695 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 08:33:57,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:33:57 BoogieIcfgContainer [2022-12-13 08:33:57,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 08:33:57,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 08:33:57,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 08:33:57,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 08:33:57,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:33:56" (1/3) ... [2022-12-13 08:33:57,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393af339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:33:57, skipping insertion in model container [2022-12-13 08:33:57,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:33:56" (2/3) ... [2022-12-13 08:33:57,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393af339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:33:57, skipping insertion in model container [2022-12-13 08:33:57,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:33:57" (3/3) ... [2022-12-13 08:33:57,706 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-12-13 08:33:57,719 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 08:33:57,719 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 08:33:57,719 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 08:33:57,775 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 08:33:57,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 163 transitions, 342 flow [2022-12-13 08:33:57,884 INFO L130 PetriNetUnfolder]: 13/161 cut-off events. [2022-12-13 08:33:57,884 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:33:57,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 161 events. 13/161 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-13 08:33:57,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 163 transitions, 342 flow [2022-12-13 08:33:57,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 153 transitions, 318 flow [2022-12-13 08:33:57,899 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:33:57,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-13 08:33:57,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 153 transitions, 318 flow [2022-12-13 08:33:57,965 INFO L130 PetriNetUnfolder]: 13/153 cut-off events. [2022-12-13 08:33:57,966 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:33:57,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 153 events. 13/153 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-13 08:33:57,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-13 08:33:57,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 08:34:03,025 INFO L241 LiptonReduction]: Total number of compositions: 134 [2022-12-13 08:34:03,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 08:34:03,058 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;@ca95fff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 08:34:03,062 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 08:34:03,074 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-13 08:34:03,075 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:34:03,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:34:03,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:34:03,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:34:03,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:34:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash -737479510, now seen corresponding path program 1 times [2022-12-13 08:34:03,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:34:03,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913274773] [2022-12-13 08:34:03,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:34:03,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:34:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:34:03,417 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 08:34:03,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:34:03,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913274773] [2022-12-13 08:34:03,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913274773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:34:03,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:34:03,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 08:34:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986102275] [2022-12-13 08:34:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:34:03,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:34:03,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:34:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:34:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:34:03,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:34:03,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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:34:03,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:34:03,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:34:03,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:34:03,500 INFO L130 PetriNetUnfolder]: 81/147 cut-off events. [2022-12-13 08:34:03,500 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 08:34:03,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 81/147 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 424 event pairs, 24 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 240. Up to 88 conditions per place. [2022-12-13 08:34:03,503 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2022-12-13 08:34:03,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2022-12-13 08:34:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:34:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 08:34:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 08:34:03,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-13 08:34:03,516 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2022-12-13 08:34:03,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 31 transitions, 145 flow [2022-12-13 08:34:03,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 30 transitions, 138 flow [2022-12-13 08:34:03,519 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:34:03,520 INFO L89 Accepts]: Start accepts. Operand has 24 places, 30 transitions, 138 flow [2022-12-13 08:34:03,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:34:03,523 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:34:03,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 30 transitions, 138 flow [2022-12-13 08:34:03,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 30 transitions, 138 flow [2022-12-13 08:34:03,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:34:03,526 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:34:03,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 08:34:03,528 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 30 transitions, 138 flow [2022-12-13 08:34:03,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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:34:03,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:34:03,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:34:03,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 08:34:03,532 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:34:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:34:03,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1426168016, now seen corresponding path program 1 times [2022-12-13 08:34:03,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:34:03,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020539803] [2022-12-13 08:34:03,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:34:03,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:34:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:34:03,667 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 08:34:03,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:34:03,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020539803] [2022-12-13 08:34:03,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020539803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:34:03,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:34:03,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 08:34:03,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449420957] [2022-12-13 08:34:03,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:34:03,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:34:03,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:34:03,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:34:03,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:34:03,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:34:03,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 30 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:34:03,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:34:03,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:34:03,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:34:03,744 INFO L130 PetriNetUnfolder]: 77/142 cut-off events. [2022-12-13 08:34:03,744 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 08:34:03,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 142 events. 77/142 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 405 event pairs, 11 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 348. Up to 88 conditions per place. [2022-12-13 08:34:03,745 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 27 selfloop transitions, 7 changer transitions 4/38 dead transitions. [2022-12-13 08:34:03,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 38 transitions, 249 flow [2022-12-13 08:34:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:34:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:34:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-13 08:34:03,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2022-12-13 08:34:03,748 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2022-12-13 08:34:03,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 38 transitions, 249 flow [2022-12-13 08:34:03,749 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 34 transitions, 222 flow [2022-12-13 08:34:03,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:34:03,750 INFO L89 Accepts]: Start accepts. Operand has 27 places, 34 transitions, 222 flow [2022-12-13 08:34:03,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:34:03,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:34:03,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 34 transitions, 222 flow [2022-12-13 08:34:03,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 34 transitions, 222 flow [2022-12-13 08:34:03,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:34:03,753 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:34:03,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:34:03,755 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 34 transitions, 222 flow [2022-12-13 08:34:03,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:34:03,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:34:03,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:34:03,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 08:34:03,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:34:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:34:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1982189810, now seen corresponding path program 2 times [2022-12-13 08:34:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:34:03,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097665112] [2022-12-13 08:34:03,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:34:03,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:34:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:34:03,860 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 08:34:03,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:34:03,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097665112] [2022-12-13 08:34:03,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097665112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:34:03,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:34:03,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 08:34:03,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786218895] [2022-12-13 08:34:03,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:34:03,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:34:03,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:34:03,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:34:03,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:34:03,865 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:34:03,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 34 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:34:03,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:34:03,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:34:03,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:34:03,934 INFO L130 PetriNetUnfolder]: 81/150 cut-off events. [2022-12-13 08:34:03,935 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 08:34:03,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 150 events. 81/150 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 438 event pairs, 6 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 522. Up to 114 conditions per place. [2022-12-13 08:34:03,938 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 34 selfloop transitions, 8 changer transitions 3/45 dead transitions. [2022-12-13 08:34:03,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 381 flow [2022-12-13 08:34:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:34:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:34:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 08:34:03,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4631578947368421 [2022-12-13 08:34:03,941 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2022-12-13 08:34:03,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 45 transitions, 381 flow [2022-12-13 08:34:03,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 42 transitions, 354 flow [2022-12-13 08:34:03,943 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:34:03,943 INFO L89 Accepts]: Start accepts. Operand has 31 places, 42 transitions, 354 flow [2022-12-13 08:34:03,944 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:34:03,944 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:34:03,944 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 42 transitions, 354 flow [2022-12-13 08:34:03,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 42 transitions, 354 flow [2022-12-13 08:34:03,946 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:34:03,947 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:34:03,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:34:03,947 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 42 transitions, 354 flow [2022-12-13 08:34:03,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:34:03,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:34:03,948 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:34:03,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 08:34:03,948 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:34:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:34:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash 552214239, now seen corresponding path program 1 times [2022-12-13 08:34:03,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:34:03,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944278930] [2022-12-13 08:34:03,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:34:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:34:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:34:04,037 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 08:34:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:34:04,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944278930] [2022-12-13 08:34:04,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944278930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:34:04,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:34:04,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 08:34:04,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309590349] [2022-12-13 08:34:04,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:34:04,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:34:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:34:04,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:34:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:34:04,041 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:34:04,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 42 transitions, 354 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:34:04,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:34:04,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:34:04,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:34:04,093 INFO L130 PetriNetUnfolder]: 82/155 cut-off events. [2022-12-13 08:34:04,093 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-13 08:34:04,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 155 events. 82/155 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 441 event pairs, 6 based on Foata normal form. 10/138 useless extension candidates. Maximal degree in co-relation 625. Up to 144 conditions per place. [2022-12-13 08:34:04,126 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 41 selfloop transitions, 2 changer transitions 9/52 dead transitions. [2022-12-13 08:34:04,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 52 transitions, 544 flow [2022-12-13 08:34:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:34:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:34:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-13 08:34:04,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3815789473684211 [2022-12-13 08:34:04,140 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 12 predicate places. [2022-12-13 08:34:04,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 52 transitions, 544 flow [2022-12-13 08:34:04,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 43 transitions, 448 flow [2022-12-13 08:34:04,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:34:04,142 INFO L89 Accepts]: Start accepts. Operand has 33 places, 43 transitions, 448 flow [2022-12-13 08:34:04,143 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:34:04,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:34:04,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 43 transitions, 448 flow [2022-12-13 08:34:04,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 43 transitions, 448 flow [2022-12-13 08:34:04,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:34:04,417 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:34:04,418 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-13 08:34:04,418 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 42 transitions, 438 flow [2022-12-13 08:34:04,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:34:04,418 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:34:04,418 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:34:04,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 08:34:04,418 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:34:04,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:34:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash 46655614, now seen corresponding path program 1 times [2022-12-13 08:34:04,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:34:04,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384390033] [2022-12-13 08:34:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:34:04,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:34:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:34:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:34:04,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:34:04,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384390033] [2022-12-13 08:34:04,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384390033] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:34:04,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321334435] [2022-12-13 08:34:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:34:04,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:34:04,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:34:04,469 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 08:34:04,521 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 08:34:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:34:04,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 08:34:04,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:34:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:34:04,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:34:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:34:04,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321334435] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:34:04,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:34:04,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 08:34:04,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124204676] [2022-12-13 08:34:04,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:34:04,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 08:34:04,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:34:04,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 08:34:04,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:34:04,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:34:04,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 42 transitions, 438 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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:34:04,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:34:04,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:34:04,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:34:04,828 INFO L130 PetriNetUnfolder]: 108/201 cut-off events. [2022-12-13 08:34:04,828 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 08:34:04,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 201 events. 108/201 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 627 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 1033. Up to 202 conditions per place. [2022-12-13 08:34:04,830 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 54 selfloop transitions, 18 changer transitions 0/72 dead transitions. [2022-12-13 08:34:04,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 72 transitions, 897 flow [2022-12-13 08:34:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 08:34:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 08:34:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-12-13 08:34:04,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3567251461988304 [2022-12-13 08:34:04,831 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 18 predicate places. [2022-12-13 08:34:04,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 72 transitions, 897 flow [2022-12-13 08:34:04,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 72 transitions, 897 flow [2022-12-13 08:34:04,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:34:04,834 INFO L89 Accepts]: Start accepts. Operand has 40 places, 72 transitions, 897 flow [2022-12-13 08:34:04,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:34:04,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:34:04,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 72 transitions, 897 flow [2022-12-13 08:34:04,836 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 72 transitions, 897 flow [2022-12-13 08:34:04,836 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:34:04,836 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:34:04,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 08:34:04,836 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 72 transitions, 897 flow [2022-12-13 08:34:04,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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:34:04,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:34:04,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:34:04,874 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 08:34:05,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:34:05,055 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:34:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:34:05,056 INFO L85 PathProgramCache]: Analyzing trace with hash 453465634, now seen corresponding path program 2 times [2022-12-13 08:34:05,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:34:05,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118815367] [2022-12-13 08:34:05,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:34:05,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:34:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:34:05,109 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 08:34:05,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:34:05,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118815367] [2022-12-13 08:34:05,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118815367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:34:05,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:34:05,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 08:34:05,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111648361] [2022-12-13 08:34:05,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:34:05,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:34:05,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:34:05,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:34:05,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:34:05,111 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:34:05,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 72 transitions, 897 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:34:05,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:34:05,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:34:05,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:34:05,160 INFO L130 PetriNetUnfolder]: 102/183 cut-off events. [2022-12-13 08:34:05,160 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 08:34:05,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 183 events. 102/183 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 513 event pairs, 0 based on Foata normal form. 2/157 useless extension candidates. Maximal degree in co-relation 1091. Up to 184 conditions per place. [2022-12-13 08:34:05,162 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 61 selfloop transitions, 4 changer transitions 2/67 dead transitions. [2022-12-13 08:34:05,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 968 flow [2022-12-13 08:34:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:34:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:34:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-13 08:34:05,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3815789473684211 [2022-12-13 08:34:05,165 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 21 predicate places. [2022-12-13 08:34:05,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 67 transitions, 968 flow [2022-12-13 08:34:05,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 65 transitions, 940 flow [2022-12-13 08:34:05,167 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:34:05,167 INFO L89 Accepts]: Start accepts. Operand has 41 places, 65 transitions, 940 flow [2022-12-13 08:34:05,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:34:05,168 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:34:05,168 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 65 transitions, 940 flow [2022-12-13 08:34:05,170 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 65 transitions, 940 flow [2022-12-13 08:34:05,170 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:34:05,171 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:34:05,172 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 08:34:05,172 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 65 transitions, 940 flow [2022-12-13 08:34:05,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:34:05,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:34:05,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:34:05,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 08:34:05,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:34:05,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:34:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1443017342, now seen corresponding path program 1 times [2022-12-13 08:34:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:34:05,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176262698] [2022-12-13 08:34:05,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:34:05,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:34:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:34:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:34:05,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:34:05,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176262698] [2022-12-13 08:34:05,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176262698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:34:05,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:34:05,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 08:34:05,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064370104] [2022-12-13 08:34:05,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:34:05,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:34:05,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:34:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:34:05,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:34:05,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:34:05,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 65 transitions, 940 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:34:05,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:34:05,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:34:05,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:34:05,303 INFO L130 PetriNetUnfolder]: 105/195 cut-off events. [2022-12-13 08:34:05,303 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 08:34:05,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1595 conditions, 195 events. 105/195 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 556 event pairs, 0 based on Foata normal form. 8/175 useless extension candidates. Maximal degree in co-relation 1222. Up to 196 conditions per place. [2022-12-13 08:34:05,305 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 64 selfloop transitions, 2 changer transitions 11/77 dead transitions. [2022-12-13 08:34:05,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 77 transitions, 1271 flow [2022-12-13 08:34:05,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:34:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:34:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-13 08:34:05,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2022-12-13 08:34:05,308 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 22 predicate places. [2022-12-13 08:34:05,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 77 transitions, 1271 flow [2022-12-13 08:34:05,309 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 66 transitions, 1086 flow [2022-12-13 08:34:05,311 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:34:05,311 INFO L89 Accepts]: Start accepts. Operand has 43 places, 66 transitions, 1086 flow [2022-12-13 08:34:05,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:34:05,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:34:05,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 66 transitions, 1086 flow [2022-12-13 08:34:05,313 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 66 transitions, 1086 flow [2022-12-13 08:34:05,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:34:06,234 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:34:06,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 924 [2022-12-13 08:34:06,235 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 65 transitions, 1070 flow [2022-12-13 08:34:06,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:34:06,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:34:06,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:34:06,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 08:34:06,235 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:34:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:34:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1207979137, now seen corresponding path program 1 times [2022-12-13 08:34:06,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:34:06,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100888608] [2022-12-13 08:34:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:34:06,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:34:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:34:07,484 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:34:07,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:34:07,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100888608] [2022-12-13 08:34:07,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100888608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:34:07,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001489139] [2022-12-13 08:34:07,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:34:07,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:34:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:34:07,486 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 08:34:07,520 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 08:34:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:34:07,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 08:34:07,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:34:07,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:34:07,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:34:07,648 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 08:34:07,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2022-12-13 08:34:07,657 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 16 treesize of output 12 [2022-12-13 08:34:07,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:34:07,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:34:07,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:34:07,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:34:07,731 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-12-13 08:34:07,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 17 [2022-12-13 08:34:07,741 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 16 treesize of output 12 [2022-12-13 08:34:07,802 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:34:07,876 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:34:08,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 20 [2022-12-13 08:34:08,317 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:34:08,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:34:09,300 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:34:09,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001489139] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:34:09,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:34:09,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-12-13 08:34:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953604445] [2022-12-13 08:34:09,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:34:09,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 08:34:09,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:34:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 08:34:09,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=818, Unknown=2, NotChecked=0, Total=930 [2022-12-13 08:34:09,302 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:34:09,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 65 transitions, 1070 flow. Second operand has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 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:34:09,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:34:09,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:34:09,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:34:12,246 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:34:29,392 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:34:31,409 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:34:45,908 WARN L233 SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 177 DAG size of output: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:34:47,927 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:34:47,945 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~q2_front~0 4)) (.cse12 (* c_~q2_back~0 4))) (let ((.cse13 (not (<= 0 c_~q1_back~0))) (.cse14 (not (< c_~q2_back~0 c_~n2~0))) (.cse15 (not (< c_~q1_back~0 c_~n1~0))) (.cse6 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse19 (+ .cse12 c_~q2~0.offset)) (.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ c_~i~0 1)) (.cse22 (+ c_~q2~0.offset .cse11)) (.cse16 (not (<= 0 c_~q2_back~0)))) (and (or (let ((.cse3 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_177) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_178))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (select .cse7 c_~q1~0.base))) (or (< (select .cse0 .cse1) c_~i~0) (not (= c_~i~0 (select .cse2 .cse3))) (< (select .cse2 .cse4) .cse5) (not (= (select .cse0 .cse6) c_~j~0)))))) (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_177) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_178))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse9 (select .cse10 c_~q1~0.base))) (or (not (= c_~i~0 (select .cse8 .cse3))) (< (select .cse8 .cse4) c_~i~0) (< (select .cse9 .cse1) .cse5) (not (= (select .cse9 .cse6) c_~j~0)))))))) .cse13 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14 .cse15 .cse16) (let ((.cse17 (select |c_#memory_int| c_~q1~0.base)) (.cse18 (select |c_#memory_int| c_~q2~0.base))) (or (not (= (select .cse17 .cse6) c_~j~0)) .cse13 .cse14 .cse15 .cse16 (not (= c_~i~0 (select .cse18 .cse19))) (let ((.cse21 (select .cse18 .cse22)) (.cse20 (select .cse17 .cse1))) (and (or (< .cse20 .cse5) (< .cse21 c_~i~0)) (or (< .cse21 .cse5) (< .cse20 c_~i~0)))))) (or .cse13 .cse14 .cse15 (and (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_178))) (let ((.cse23 (select .cse25 c_~q1~0.base)) (.cse24 (select .cse25 c_~q2~0.base))) (or (not (= (select .cse23 .cse6) c_~j~0)) (< (select .cse23 .cse1) c_~i~0) (not (= c_~i~0 (select .cse24 .cse19))) (< (select .cse24 .cse22) .cse5))))) (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_178))) (let ((.cse26 (select .cse28 c_~q1~0.base)) (.cse27 (select .cse28 c_~q2~0.base))) (or (not (= (select .cse26 .cse6) c_~j~0)) (not (= c_~i~0 (select .cse27 .cse19))) (< (select .cse26 .cse1) .cse5) (< (select .cse27 .cse22) c_~i~0)))))) .cse16)))) is different from false [2022-12-13 08:34:50,042 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:35:00,792 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:35:09,282 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:35:11,298 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:35:22,019 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:35:32,774 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:35:45,876 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:35:48,166 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:35:50,184 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:36:20,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 08:36:27,316 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 95 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:36:35,498 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:36:37,632 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:36:39,662 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:36:46,104 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:36:52,335 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:36:54,355 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:36:58,842 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:36:59,121 INFO L130 PetriNetUnfolder]: 405/729 cut-off events. [2022-12-13 08:36:59,121 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-13 08:36:59,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6640 conditions, 729 events. 405/729 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3345 event pairs, 4 based on Foata normal form. 9/634 useless extension candidates. Maximal degree in co-relation 3774. Up to 730 conditions per place. [2022-12-13 08:36:59,126 INFO L137 encePairwiseOnDemand]: 4/19 looper letters, 152 selfloop transitions, 174 changer transitions 16/342 dead transitions. [2022-12-13 08:36:59,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 342 transitions, 6285 flow [2022-12-13 08:36:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-13 08:36:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-13 08:36:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 236 transitions. [2022-12-13 08:36:59,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24842105263157896 [2022-12-13 08:36:59,129 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 69 predicate places. [2022-12-13 08:36:59,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 342 transitions, 6285 flow [2022-12-13 08:36:59,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 326 transitions, 5979 flow [2022-12-13 08:36:59,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:36:59,139 INFO L89 Accepts]: Start accepts. Operand has 88 places, 326 transitions, 5979 flow [2022-12-13 08:36:59,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:36:59,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:36:59,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 326 transitions, 5979 flow [2022-12-13 08:36:59,145 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 326 transitions, 5979 flow [2022-12-13 08:36:59,145 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:37:06,090 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 08:37:06,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6953 [2022-12-13 08:37:06,091 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 323 transitions, 5925 flow [2022-12-13 08:37:06,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 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:37:06,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:37:06,091 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:37:06,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 08:37:06,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 08:37:06,292 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:37:06,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:37:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash 234525105, now seen corresponding path program 1 times [2022-12-13 08:37:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:37:06,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728041722] [2022-12-13 08:37:06,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:37:06,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:37:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:37:07,678 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:37:07,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:37:07,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728041722] [2022-12-13 08:37:07,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728041722] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:37:07,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131898930] [2022-12-13 08:37:07,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:37:07,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:37:07,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:37:07,728 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 08:37:07,729 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 08:37:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:37:07,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 08:37:07,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:37:08,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:37:08,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 36 [2022-12-13 08:37:08,139 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:37:08,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:37:08,487 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-13 08:37:08,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 236 [2022-12-13 08:37:11,199 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:37:11,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131898930] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:37:11,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:37:11,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-13 08:37:11,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162136829] [2022-12-13 08:37:11,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:37:11,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 08:37:11,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:37:11,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 08:37:11,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-12-13 08:37:11,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 08:37:11,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 323 transitions, 5925 flow. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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:37:11,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:37:11,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 08:37:11,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:37:12,918 INFO L130 PetriNetUnfolder]: 460/833 cut-off events. [2022-12-13 08:37:12,918 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-13 08:37:12,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8419 conditions, 833 events. 460/833 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4041 event pairs, 9 based on Foata normal form. 4/723 useless extension candidates. Maximal degree in co-relation 4832. Up to 834 conditions per place. [2022-12-13 08:37:12,926 INFO L137 encePairwiseOnDemand]: 7/23 looper letters, 229 selfloop transitions, 182 changer transitions 18/429 dead transitions. [2022-12-13 08:37:12,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 429 transitions, 8736 flow [2022-12-13 08:37:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 08:37:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 08:37:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 145 transitions. [2022-12-13 08:37:12,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2251552795031056 [2022-12-13 08:37:12,928 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 90 predicate places. [2022-12-13 08:37:12,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 429 transitions, 8736 flow [2022-12-13 08:37:12,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 411 transitions, 8358 flow [2022-12-13 08:37:12,945 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:37:12,945 INFO L89 Accepts]: Start accepts. Operand has 110 places, 411 transitions, 8358 flow [2022-12-13 08:37:12,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:37:12,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:37:12,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 411 transitions, 8358 flow [2022-12-13 08:37:12,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 411 transitions, 8358 flow [2022-12-13 08:37:12,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:37:13,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 08:37:13,101 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:37:13,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 08:37:13,102 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 410 transitions, 8340 flow [2022-12-13 08:37:13,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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:37:13,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:37:13,102 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:37:13,107 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 08:37:13,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:37:13,303 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:37:13,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:37:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash 983273901, now seen corresponding path program 2 times [2022-12-13 08:37:13,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:37:13,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246314868] [2022-12-13 08:37:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:37:13,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:37:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:37:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:37:13,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:37:13,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246314868] [2022-12-13 08:37:13,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246314868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:37:13,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:37:13,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:37:13,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880112648] [2022-12-13 08:37:13,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:37:13,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:37:13,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:37:13,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:37:13,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:37:13,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:37:13,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 410 transitions, 8340 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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:37:13,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:37:13,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:37:13,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:37:13,490 INFO L130 PetriNetUnfolder]: 340/620 cut-off events. [2022-12-13 08:37:13,490 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-13 08:37:13,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6884 conditions, 620 events. 340/620 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2763 event pairs, 11 based on Foata normal form. 14/547 useless extension candidates. Maximal degree in co-relation 4131. Up to 621 conditions per place. [2022-12-13 08:37:13,496 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 305 selfloop transitions, 11 changer transitions 0/316 dead transitions. [2022-12-13 08:37:13,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 316 transitions, 7056 flow [2022-12-13 08:37:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:37:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 08:37:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-13 08:37:13,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2022-12-13 08:37:13,497 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 86 predicate places. [2022-12-13 08:37:13,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 316 transitions, 7056 flow [2022-12-13 08:37:13,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 316 transitions, 7056 flow [2022-12-13 08:37:13,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:37:13,515 INFO L89 Accepts]: Start accepts. Operand has 108 places, 316 transitions, 7056 flow [2022-12-13 08:37:13,517 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:37:13,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:37:13,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 316 transitions, 7056 flow [2022-12-13 08:37:13,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 316 transitions, 7056 flow [2022-12-13 08:37:13,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:37:13,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 08:37:13,796 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 08:37:14,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] [2022-12-13 08:37:14,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-13 08:37:14,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 08:37:14,166 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 08:37:14,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 654 [2022-12-13 08:37:14,168 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 313 transitions, 7000 flow [2022-12-13 08:37:14,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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:37:14,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:37:14,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:37:14,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 08:37:14,169 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:37:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:37:14,169 INFO L85 PathProgramCache]: Analyzing trace with hash 940050525, now seen corresponding path program 3 times [2022-12-13 08:37:14,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:37:14,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019034464] [2022-12-13 08:37:14,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:37:14,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:37:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:37:15,004 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:37:15,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:37:15,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019034464] [2022-12-13 08:37:15,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019034464] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:37:15,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737583268] [2022-12-13 08:37:15,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:37:15,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:37:15,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:37:15,005 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 08:37:15,031 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 08:37:15,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 08:37:15,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:37:15,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 08:37:15,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:37:15,155 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 84 treesize of output 76 [2022-12-13 08:37:15,249 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 29 treesize of output 29 [2022-12-13 08:37:15,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 20 [2022-12-13 08:37:15,456 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:37:15,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:37:15,664 WARN L837 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q1_back~0 c_~n1~0)) (let ((.cse5 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse4 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332))) (let ((.cse3 (select .cse1 c_~q1~0.base))) (let ((.cse0 (select .cse3 .cse5))) (or (< .cse0 (+ (select (select .cse1 c_~q2~0.base) .cse2) 1)) (< (+ 1 .cse0) c_~N~0) (not (= c_~j~0 (select .cse3 .cse4)))))))) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332))) (let ((.cse6 (select .cse7 c_~q1~0.base))) (or (< (+ 1 (select .cse6 .cse5)) c_~N~0) (not (= c_~j~0 (select .cse6 .cse4))) (< (select (select .cse7 c_~q2~0.base) .cse2) c_~N~0)))))))) is different from false [2022-12-13 08:37:15,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:37:15,711 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 280 treesize of output 300 [2022-12-13 08:37:15,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:37:15,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 204 [2022-12-13 08:37:15,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:37:15,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 186 [2022-12-13 08:37:22,617 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:37:22,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737583268] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:37:22,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:37:22,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-13 08:37:22,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717124298] [2022-12-13 08:37:22,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:37:22,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 08:37:22,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:37:22,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 08:37:22,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2022-12-13 08:37:22,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 08:37:22,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 313 transitions, 7000 flow. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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:37:22,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:37:22,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 08:37:22,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:37:25,381 INFO L130 PetriNetUnfolder]: 548/1011 cut-off events. [2022-12-13 08:37:25,381 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-12-13 08:37:25,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12233 conditions, 1011 events. 548/1011 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5303 event pairs, 3 based on Foata normal form. 2/862 useless extension candidates. Maximal degree in co-relation 7463. Up to 1012 conditions per place. [2022-12-13 08:37:25,388 INFO L137 encePairwiseOnDemand]: 9/33 looper letters, 274 selfloop transitions, 223 changer transitions 5/502 dead transitions. [2022-12-13 08:37:25,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 502 transitions, 12235 flow [2022-12-13 08:37:25,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 08:37:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-13 08:37:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 204 transitions. [2022-12-13 08:37:25,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16267942583732056 [2022-12-13 08:37:25,391 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 120 predicate places. [2022-12-13 08:37:25,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 502 transitions, 12235 flow [2022-12-13 08:37:25,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 497 transitions, 12109 flow [2022-12-13 08:37:25,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:37:25,406 INFO L89 Accepts]: Start accepts. Operand has 142 places, 497 transitions, 12109 flow [2022-12-13 08:37:25,409 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:37:25,409 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:37:25,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 497 transitions, 12109 flow [2022-12-13 08:37:25,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 497 transitions, 12109 flow [2022-12-13 08:37:25,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:37:25,425 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 08:37:25,462 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 08:37:25,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 08:37:25,610 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [722] L97-4-->L47-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem22#1_48| (select (select |v_#memory_int_274| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_53|)) (= (ite (and (<= 0 v_~q1_front~0_147) (< v_~q1_front~0_147 v_~n1~0_104) (< v_~q1_front~0_147 v_~q1_back~0_141)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_73| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|) (= (+ (select (select |v_#memory_int_274| v_~q1~0.base_119) (+ (* v_~q1_front~0_147 4) v_~q1~0.offset_119)) 1) v_~i~0_141) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_73| 0)) (= v_~q1_front~0_146 (+ v_~q1_front~0_147 1))) InVars {~q1~0.offset=v_~q1~0.offset_119, ~q1_front~0=v_~q1_front~0_147, ~q1_back~0=v_~q1_back~0_141, ~n1~0=v_~n1~0_104, ~q1~0.base=v_~q1~0.base_119, #memory_int=|v_#memory_int_274|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|} OutVars{~q1~0.offset=v_~q1~0.offset_119, ~q1_front~0=v_~q1_front~0_146, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_41|, ~i~0=v_~i~0_141, ~n1~0=v_~n1~0_104, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_47|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_65|, ~q1_back~0=v_~q1_back~0_141, ~q1~0.base=v_~q1~0.base_119, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_53|, #memory_int=|v_#memory_int_274|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_73|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_47|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_48|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, ~q1_front~0, ULTIMATE.start_main_#t~nondet21#1, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~mem22#1] [2022-12-13 08:37:25,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [723] L97-4-->L65-1: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= (ite (and (< v_~q2_front~0_112 v_~n2~0_108) (<= 0 v_~q2_front~0_112) (< v_~q2_front~0_112 v_~q2_back~0_144)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= v_~j~0_120 (+ (select (select |v_#memory_int_276| v_~q2~0.base_95) (+ v_~q2~0.offset_95 (* v_~q2_front~0_112 4))) 1)) (= |v_ULTIMATE.start_main_#t~mem22#1_50| (select (select |v_#memory_int_276| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) |v_ULTIMATE.start_main_~#t1~0#1.offset_55|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= v_~q2_front~0_111 (+ v_~q2_front~0_112 1))) InVars {~n2~0=v_~n2~0_108, ~q2~0.offset=v_~q2~0.offset_95, #memory_int=|v_#memory_int_276|, ~q2_front~0=v_~q2_front~0_112, ~q2~0.base=v_~q2~0.base_95, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ~q2_back~0=v_~q2_back~0_144} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_34|, ~j~0=v_~j~0_120, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_28|, ~n2~0=v_~n2~0_108, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_43|, ~q2~0.offset=v_~q2~0.offset_95, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, ~q2_front~0=v_~q2_front~0_111, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_28|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_67|, #memory_int=|v_#memory_int_276|, ~q2~0.base=v_~q2~0.base_95, ~q2_back~0=v_~q2_back~0_144, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_50|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, ULTIMATE.start_main_#t~mem22#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 08:37:25,880 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 08:37:25,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 474 [2022-12-13 08:37:25,880 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 496 transitions, 12093 flow [2022-12-13 08:37:25,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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:37:25,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:37:25,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:37:25,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 08:37:26,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:37:26,081 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:37:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:37:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1918315351, now seen corresponding path program 4 times [2022-12-13 08:37:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:37:26,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435846990] [2022-12-13 08:37:26,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:37:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:37:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:37:27,124 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:37:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:37:27,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435846990] [2022-12-13 08:37:27,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435846990] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:37:27,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447688857] [2022-12-13 08:37:27,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:37:27,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:37:27,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:37:27,126 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:37:27,126 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:37:27,202 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:37:27,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:37:27,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 08:37:27,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:37:27,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:37:27,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:37:27,226 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:37:27,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:37:27,232 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:37:27,236 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:37:27,239 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:37:27,242 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 18 treesize of output 16 [2022-12-13 08:37:27,243 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-13 08:37:27,247 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:37:27,342 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 18 treesize of output 20 [2022-12-13 08:37:27,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:37:27,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 17 [2022-12-13 08:37:27,661 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:37:27,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:37:28,636 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:37:28,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447688857] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:37:28,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:37:28,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-12-13 08:37:28,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028172205] [2022-12-13 08:37:28,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:37:28,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 08:37:28,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:37:28,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 08:37:28,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=556, Unknown=4, NotChecked=0, Total=650 [2022-12-13 08:37:28,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 08:37:28,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 496 transitions, 12093 flow. Second operand has 26 states, 25 states have (on average 1.64) internal successors, (41), 25 states have internal predecessors, (41), 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:37:28,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:37:28,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 08:37:28,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:37:45,756 INFO L130 PetriNetUnfolder]: 634/1215 cut-off events. [2022-12-13 08:37:45,757 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-13 08:37:45,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15920 conditions, 1215 events. 634/1215 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6758 event pairs, 7 based on Foata normal form. 12/1042 useless extension candidates. Maximal degree in co-relation 10143. Up to 1216 conditions per place. [2022-12-13 08:37:45,763 INFO L137 encePairwiseOnDemand]: 12/36 looper letters, 352 selfloop transitions, 265 changer transitions 39/656 dead transitions. [2022-12-13 08:37:45,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 656 transitions, 17320 flow [2022-12-13 08:37:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-13 08:37:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-13 08:37:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 244 transitions. [2022-12-13 08:37:45,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1473429951690821 [2022-12-13 08:37:45,765 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 157 predicate places. [2022-12-13 08:37:45,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 656 transitions, 17320 flow [2022-12-13 08:37:45,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 617 transitions, 16271 flow [2022-12-13 08:37:45,779 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:37:45,779 INFO L89 Accepts]: Start accepts. Operand has 171 places, 617 transitions, 16271 flow [2022-12-13 08:37:45,782 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:37:45,782 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:37:45,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 617 transitions, 16271 flow [2022-12-13 08:37:45,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 617 transitions, 16271 flow [2022-12-13 08:37:45,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:37:45,796 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] and [719] L52-->L98-1: Formula: (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_64| 0)) (= (+ v_~q1_front~0_134 1) v_~q1_front~0_133) (= (ite (and (< v_~q1_front~0_134 v_~n1~0_98) (<= 0 v_~q1_front~0_134) (< v_~q1_front~0_134 v_~q1_back~0_132)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (= v_~i~0_134 (+ (select (select |v_#memory_int_266| v_~q1~0.base_113) (+ v_~q1~0.offset_113 (* v_~q1_front~0_134 4))) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_64| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (= |v_ULTIMATE.start_main_#t~mem22#1_44| (select (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_51|))) InVars {~q1~0.offset=v_~q1~0.offset_113, ~q1_front~0=v_~q1_front~0_134, ~q1_back~0=v_~q1_back~0_132, ~n1~0=v_~n1~0_98, ~q1~0.base=v_~q1~0.base_113, #memory_int=|v_#memory_int_266|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|} OutVars{~q1~0.offset=v_~q1~0.offset_113, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_38|, ~q1_front~0=v_~q1_front~0_133, ~i~0=v_~i~0_134, ~n1~0=v_~n1~0_98, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_61|, ~q1_back~0=v_~q1_back~0_132, ~q1~0.base=v_~q1~0.base_113, #memory_int=|v_#memory_int_266|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_64|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_39|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_44|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~mem22#1] [2022-12-13 08:37:45,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [715] L65-1-->L65-1: Formula: (and (not (= (ite (and (< v_~q1_back~0_121 v_~n1~0_90) (<= 0 v_~q1_back~0_121)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|) (not (= (ite (= v_~j~0_110 (select (select |v_#memory_int_258| v_~q1~0.base_105) (+ v_~q1~0.offset_105 (* v_~q1_back~0_121 4)))) 1 0) 0)) (< v_~j~0_110 v_~N~0_79) (= (ite (and (< v_~q2_front~0_107 v_~q2_back~0_137) (<= 0 v_~q2_front~0_107) (< v_~q2_front~0_107 v_~n2~0_104)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|) (= v_~j~0_109 (+ (select (select |v_#memory_int_258| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* v_~q2_front~0_107 4))) 1)) (= (+ v_~q1_back~0_121 1) v_~q1_back~0_120) (= (+ v_~q2_front~0_107 1) v_~q2_front~0_106)) InVars {~j~0=v_~j~0_110, ~q1~0.offset=v_~q1~0.offset_105, ~n2~0=v_~n2~0_104, ~q1_back~0=v_~q1_back~0_121, ~q2~0.offset=v_~q2~0.offset_91, ~n1~0=v_~n1~0_90, ~q1~0.base=v_~q1~0.base_105, #memory_int=|v_#memory_int_258|, ~q2_front~0=v_~q2_front~0_107, ~q2~0.base=v_~q2~0.base_91, ~N~0=v_~N~0_79, ~q2_back~0=v_~q2_back~0_137} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_30|, ~j~0=v_~j~0_109, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_24|, ~q1~0.offset=v_~q1~0.offset_105, ~n2~0=v_~n2~0_104, ~q2~0.offset=v_~q2~0.offset_91, ~n1~0=v_~n1~0_90, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|, ~q2_front~0=v_~q2_front~0_106, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_18|, ~N~0=v_~N~0_79, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_18|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_24|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36|, ~q1_back~0=v_~q1_back~0_120, ~q1~0.base=v_~q1~0.base_105, #memory_int=|v_#memory_int_258|, ~q2~0.base=v_~q2~0.base_91, ~q2_back~0=v_~q2_back~0_137} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 08:37:46,140 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:46,140 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:46,140 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:46,140 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:46,140 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:46,140 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:46,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_260| v_~q1~0.base_107))) (and (= (ite (= v_~j~0_113 (select .cse0 (+ v_~q1~0.offset_107 (* v_~q1_back~0_125 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| 0)) (= (+ v_~q1_back~0_125 1) v_~q1_back~0_124) (not (= (ite (and (<= 0 v_~q1_back~0_125) (< v_~q1_back~0_125 v_~n1~0_92)) 1 0) 0)) (= (+ (select .cse0 (+ (* v_~q1_front~0_122 4) v_~q1~0.offset_107)) 1) v_~i~0_128) (= (ite (and (< v_~q1_front~0_122 v_~q1_back~0_124) (<= 0 v_~q1_front~0_122) (< v_~q1_front~0_122 v_~n1~0_92)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_56|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_56|) (= v_~q1_front~0_121 (+ v_~q1_front~0_122 1)) (< v_~j~0_113 v_~N~0_81))) InVars {~j~0=v_~j~0_113, ~q1~0.offset=v_~q1~0.offset_107, ~q1_front~0=v_~q1_front~0_122, ~q1_back~0=v_~q1_back~0_125, ~n1~0=v_~n1~0_92, ~q1~0.base=v_~q1~0.base_107, #memory_int=|v_#memory_int_260|, ~N~0=v_~N~0_81} OutVars{~j~0=v_~j~0_113, ~q1~0.offset=v_~q1~0.offset_107, ~q1_front~0=v_~q1_front~0_121, ~i~0=v_~i~0_128, ~n1~0=v_~n1~0_92, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_20|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_20|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_56|, ~q1_back~0=v_~q1_back~0_124, ~q1~0.base=v_~q1~0.base_107, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_39|, #memory_int=|v_#memory_int_260|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 08:37:46,710 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [730] L65-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_25| 0) (= (+ v_~q2_front~0_133 1) v_~q2_front~0_132) (not (= (ite (= v_~j~0_134 (select (select |v_#memory_int_293| v_~q1~0.base_129) (+ v_~q1~0.offset_129 (* v_~q1_back~0_155 4)))) 1 0) 0)) (= (ite (and (< v_~q2_front~0_133 v_~n2~0_122) (< v_~q2_front~0_133 v_~q2_back~0_168) (<= 0 v_~q2_front~0_133)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= (+ v_~q1_back~0_155 1) v_~q1_back~0_154) (not (< v_~j~0_133 v_~N~0_101)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_60| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_155) (< v_~q1_back~0_155 v_~n1~0_114)) 1 0) 0)) (= v_~j~0_133 (+ (select (select |v_#memory_int_293| v_~q2~0.base_109) (+ v_~q2~0.offset_109 (* v_~q2_front~0_133 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_60| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_25|) (< v_~j~0_134 v_~N~0_101)) InVars {~j~0=v_~j~0_134, ~q1~0.offset=v_~q1~0.offset_129, ~n2~0=v_~n2~0_122, ~q1_back~0=v_~q1_back~0_155, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_114, ~q1~0.base=v_~q1~0.base_129, #memory_int=|v_#memory_int_293|, ~q2_front~0=v_~q2_front~0_133, ~q2~0.base=v_~q2~0.base_109, ~N~0=v_~N~0_101, ~q2_back~0=v_~q2_back~0_168} OutVars{~j~0=v_~j~0_133, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_46|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_40|, ~q1~0.offset=v_~q1~0.offset_129, ~n2~0=v_~n2~0_122, ~q2~0.offset=v_~q2~0.offset_109, ~n1~0=v_~n1~0_114, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_25|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|, ~q2_front~0=v_~q2_front~0_132, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_30|, ~N~0=v_~N~0_101, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_30|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_40|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_60|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_25|, ~q1_back~0=v_~q1_back~0_154, ~q1~0.base=v_~q1~0.base_129, #memory_int=|v_#memory_int_293|, ~q2~0.base=v_~q2~0.base_109, ~q2_back~0=v_~q2_back~0_168} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 08:37:46,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [734] L65-1-->L52: Formula: (let ((.cse0 (select |v_#memory_int_299| v_~q1~0.base_135))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68| (ite (= v_~j~0_143 (select .cse0 (+ v_~q1~0.offset_135 (* v_~q1_back~0_169 4)))) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_68| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_96| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|) (not (= (ite (and (<= 0 v_~q2_back~0_173) (< v_~q2_back~0_173 v_~n2~0_126)) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_169 v_~n1~0_120) (<= 0 v_~q1_back~0_169)) 1 0) 0)) (< v_~j~0_143 v_~N~0_107) (= (ite (= v_~i~0_162 (select (select |v_#memory_int_299| v_~q2~0.base_113) (+ v_~q2~0.offset_113 (* 4 v_~q2_back~0_173)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_68| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (= (+ v_~q1_back~0_169 1) v_~q1_back~0_168) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_96| 0)) (< v_~i~0_162 v_~N~0_107) (= (+ v_~q1_front~0_172 1) v_~q1_front~0_171) (not (= (ite (and (< v_~q1_front~0_172 v_~q1_back~0_168) (< v_~q1_front~0_172 v_~n1~0_120) (<= 0 v_~q1_front~0_172)) 1 0) 0)) (= (+ v_~q2_back~0_173 1) v_~q2_back~0_172) (= v_~i~0_162 (+ (select .cse0 (+ v_~q1~0.offset_135 (* v_~q1_front~0_172 4))) 1)))) InVars {~j~0=v_~j~0_143, ~q1~0.offset=v_~q1~0.offset_135, ~n2~0=v_~n2~0_126, ~q1_front~0=v_~q1_front~0_172, ~q1_back~0=v_~q1_back~0_169, ~q2~0.offset=v_~q2~0.offset_113, ~n1~0=v_~n1~0_120, ~q1~0.base=v_~q1~0.base_135, #memory_int=|v_#memory_int_299|, ~q2~0.base=v_~q2~0.base_113, ~N~0=v_~N~0_107, ~q2_back~0=v_~q2_back~0_173} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_43|, ~j~0=v_~j~0_143, ~q1~0.offset=v_~q1~0.offset_135, ~n2~0=v_~n2~0_126, ~q1_front~0=v_~q1_front~0_171, ~i~0=v_~i~0_162, ~q2~0.offset=v_~q2~0.offset_113, ~n1~0=v_~n1~0_120, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_61|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_38|, ~N~0=v_~N~0_107, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_38|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|, ~q1_back~0=v_~q1_back~0_168, ~q1~0.base=v_~q1~0.base_135, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_96|, #memory_int=|v_#memory_int_299|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_67|, ~q2~0.base=v_~q2~0.base_113, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_61|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_43|, ~q2_back~0=v_~q2_back~0_172} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 08:37:47,069 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:47,069 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:47,070 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:47,070 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:47,070 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:47,070 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:47,070 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:47,070 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:47,070 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:47,070 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 08:37:47,260 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 08:37:47,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1482 [2022-12-13 08:37:47,261 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 613 transitions, 16181 flow [2022-12-13 08:37:47,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.64) internal successors, (41), 25 states have internal predecessors, (41), 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:37:47,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:37:47,261 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:37:47,281 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:37:47,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 08:37:47,462 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:37:47,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:37:47,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1265560680, now seen corresponding path program 1 times [2022-12-13 08:37:47,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:37:47,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341170823] [2022-12-13 08:37:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:37:47,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:37:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:37:48,211 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:37:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:37:48,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341170823] [2022-12-13 08:37:48,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341170823] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:37:48,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543994654] [2022-12-13 08:37:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:37:48,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:37:48,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:37:48,213 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:37:48,216 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:37:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:37:48,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-13 08:37:48,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:37:48,341 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 08:37:48,348 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 202 treesize of output 198 [2022-12-13 08:37:48,361 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 08:37:48,361 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 08:37:48,462 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:37:48,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:37:48,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-12-13 08:37:48,694 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:37:48,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:37:49,104 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:37:49,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543994654] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:37:49,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:37:49,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-13 08:37:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963761960] [2022-12-13 08:37:49,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:37:49,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 08:37:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:37:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 08:37:49,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=353, Unknown=1, NotChecked=0, Total=420 [2022-12-13 08:37:49,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 08:37:49,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 613 transitions, 16181 flow. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:37:49,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:37:49,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 08:37:49,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:37:54,160 INFO L130 PetriNetUnfolder]: 866/1640 cut-off events. [2022-12-13 08:37:54,161 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2022-12-13 08:37:54,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23128 conditions, 1640 events. 866/1640 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 9746 event pairs, 7 based on Foata normal form. 4/1383 useless extension candidates. Maximal degree in co-relation 13741. Up to 1641 conditions per place. [2022-12-13 08:37:54,171 INFO L137 encePairwiseOnDemand]: 8/39 looper letters, 530 selfloop transitions, 349 changer transitions 14/893 dead transitions. [2022-12-13 08:37:54,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 893 transitions, 25376 flow [2022-12-13 08:37:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 08:37:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 08:37:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 217 transitions. [2022-12-13 08:37:54,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15038115038115038 [2022-12-13 08:37:54,173 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 180 predicate places. [2022-12-13 08:37:54,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 893 transitions, 25376 flow [2022-12-13 08:37:54,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 879 transitions, 24970 flow [2022-12-13 08:37:54,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:37:54,197 INFO L89 Accepts]: Start accepts. Operand has 200 places, 879 transitions, 24970 flow [2022-12-13 08:37:54,202 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:37:54,202 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:37:54,202 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 879 transitions, 24970 flow [2022-12-13 08:37:54,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 879 transitions, 24970 flow [2022-12-13 08:37:54,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:37:54,225 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 08:37:54,443 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 08:37:54,511 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 08:37:54,512 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 315 [2022-12-13 08:37:54,512 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 878 transitions, 24946 flow [2022-12-13 08:37:54,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:37:54,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:37:54,512 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:37:54,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 08:37:54,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:37:54,717 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:37:54,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:37:54,717 INFO L85 PathProgramCache]: Analyzing trace with hash -310856721, now seen corresponding path program 1 times [2022-12-13 08:37:54,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:37:54,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315148651] [2022-12-13 08:37:54,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:37:54,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:37:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:37:55,584 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:37:55,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:37:55,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315148651] [2022-12-13 08:37:55,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315148651] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:37:55,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005916373] [2022-12-13 08:37:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:37:55,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:37:55,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:37:55,587 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:37:55,591 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:37:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:37:55,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 08:37:55,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:37:55,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:37:55,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:37:55,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:37:55,693 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 08:37:55,693 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 22 treesize of output 28 [2022-12-13 08:37:55,696 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 13 treesize of output 12 [2022-12-13 08:37:55,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:37:55,702 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 14 treesize of output 12 [2022-12-13 08:37:55,745 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:37:55,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 17 [2022-12-13 08:37:55,940 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:37:55,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:37:56,242 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:37:56,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005916373] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:37:56,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:37:56,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 08:37:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282364041] [2022-12-13 08:37:56,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:37:56,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 08:37:56,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:37:56,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 08:37:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=321, Unknown=1, NotChecked=0, Total=380 [2022-12-13 08:37:56,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 08:37:56,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 878 transitions, 24946 flow. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:37:56,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:37:56,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 08:37:56,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:02,753 INFO L130 PetriNetUnfolder]: 903/1706 cut-off events. [2022-12-13 08:38:02,753 INFO L131 PetriNetUnfolder]: For 188/188 co-relation queries the response was YES. [2022-12-13 08:38:02,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25761 conditions, 1706 events. 903/1706 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 10207 event pairs, 7 based on Foata normal form. 1/1442 useless extension candidates. Maximal degree in co-relation 15352. Up to 1707 conditions per place. [2022-12-13 08:38:02,763 INFO L137 encePairwiseOnDemand]: 10/41 looper letters, 657 selfloop transitions, 262 changer transitions 5/924 dead transitions. [2022-12-13 08:38:02,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 924 transitions, 28097 flow [2022-12-13 08:38:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 08:38:02,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 08:38:02,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 119 transitions. [2022-12-13 08:38:02,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14512195121951219 [2022-12-13 08:38:02,765 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 196 predicate places. [2022-12-13 08:38:02,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 218 places, 924 transitions, 28097 flow [2022-12-13 08:38:02,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 919 transitions, 27941 flow [2022-12-13 08:38:02,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:02,790 INFO L89 Accepts]: Start accepts. Operand has 217 places, 919 transitions, 27941 flow [2022-12-13 08:38:02,796 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:02,796 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:02,796 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 919 transitions, 27941 flow [2022-12-13 08:38:02,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 919 transitions, 27941 flow [2022-12-13 08:38:02,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:02,812 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:02,812 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 08:38:02,812 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 919 transitions, 27941 flow [2022-12-13 08:38:02,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:02,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:02,813 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:02,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 08:38:03,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:03,018 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:38:03,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1927222885, now seen corresponding path program 1 times [2022-12-13 08:38:03,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:03,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378516929] [2022-12-13 08:38:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:03,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:38:03,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:03,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378516929] [2022-12-13 08:38:03,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378516929] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:03,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214403458] [2022-12-13 08:38:03,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:03,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:03,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:03,089 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:38:03,093 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:38:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:03,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 08:38:03,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:38:03,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 08:38:03,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214403458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:03,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 08:38:03,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 08:38:03,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553803571] [2022-12-13 08:38:03,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:03,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:38:03,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:03,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:38:03,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:38:03,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 08:38:03,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 919 transitions, 27941 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:38:03,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:03,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 08:38:03,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:03,645 INFO L130 PetriNetUnfolder]: 547/1125 cut-off events. [2022-12-13 08:38:03,645 INFO L131 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2022-12-13 08:38:03,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18146 conditions, 1125 events. 547/1125 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6695 event pairs, 7 based on Foata normal form. 21/1023 useless extension candidates. Maximal degree in co-relation 6013. Up to 1126 conditions per place. [2022-12-13 08:38:03,651 INFO L137 encePairwiseOnDemand]: 31/41 looper letters, 570 selfloop transitions, 10 changer transitions 15/595 dead transitions. [2022-12-13 08:38:03,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 595 transitions, 19342 flow [2022-12-13 08:38:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:38:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:38:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-13 08:38:03,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31097560975609756 [2022-12-13 08:38:03,656 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 163 predicate places. [2022-12-13 08:38:03,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 595 transitions, 19342 flow [2022-12-13 08:38:03,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 580 transitions, 18862 flow [2022-12-13 08:38:03,671 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:03,671 INFO L89 Accepts]: Start accepts. Operand has 183 places, 580 transitions, 18862 flow [2022-12-13 08:38:03,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:03,675 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:03,675 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 580 transitions, 18862 flow [2022-12-13 08:38:03,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 580 transitions, 18862 flow [2022-12-13 08:38:03,683 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:03,684 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:03,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 08:38:03,684 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 580 transitions, 18862 flow [2022-12-13 08:38:03,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:38:03,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:03,685 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:03,702 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:38:03,890 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,SelfDestructingSolverStorable14 [2022-12-13 08:38:03,890 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:38:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:03,891 INFO L85 PathProgramCache]: Analyzing trace with hash -764811668, now seen corresponding path program 1 times [2022-12-13 08:38:03,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:03,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591129913] [2022-12-13 08:38:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:03,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:38:03,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:03,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591129913] [2022-12-13 08:38:03,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591129913] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:03,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313851090] [2022-12-13 08:38:03,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:03,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:03,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:03,993 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:38:03,994 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:38:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:04,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 08:38:04,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:38:04,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 08:38:04,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313851090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:04,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 08:38:04,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 08:38:04,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457607664] [2022-12-13 08:38:04,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:04,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:38:04,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:04,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:38:04,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:38:04,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 08:38:04,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 580 transitions, 18862 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:38:04,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:04,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 08:38:04,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:04,389 INFO L130 PetriNetUnfolder]: 418/887 cut-off events. [2022-12-13 08:38:04,389 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-13 08:38:04,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15205 conditions, 887 events. 418/887 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4953 event pairs, 0 based on Foata normal form. 38/842 useless extension candidates. Maximal degree in co-relation 4737. Up to 888 conditions per place. [2022-12-13 08:38:04,397 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 434 selfloop transitions, 9 changer transitions 63/506 dead transitions. [2022-12-13 08:38:04,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 506 transitions, 17434 flow [2022-12-13 08:38:04,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:38:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:38:04,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 08:38:04,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2022-12-13 08:38:04,405 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 143 predicate places. [2022-12-13 08:38:04,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 506 transitions, 17434 flow [2022-12-13 08:38:04,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 443 transitions, 15247 flow [2022-12-13 08:38:04,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:04,423 INFO L89 Accepts]: Start accepts. Operand has 133 places, 443 transitions, 15247 flow [2022-12-13 08:38:04,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:04,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:04,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 443 transitions, 15247 flow [2022-12-13 08:38:04,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 443 transitions, 15247 flow [2022-12-13 08:38:04,439 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:04,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 08:38:04,527 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:38:04,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 08:38:04,528 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 442 transitions, 15215 flow [2022-12-13 08:38:04,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:38:04,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:04,528 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:04,534 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:38:04,728 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,SelfDestructingSolverStorable15 [2022-12-13 08:38:04,729 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:38:04,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:04,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2027149870, now seen corresponding path program 1 times [2022-12-13 08:38:04,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:04,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244010625] [2022-12-13 08:38:04,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:04,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:05,225 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:38:05,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244010625] [2022-12-13 08:38:05,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244010625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772575387] [2022-12-13 08:38:05,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:05,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:05,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:05,244 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:38:05,246 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:38:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:05,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 08:38:05,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:05,348 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 51 treesize of output 49 [2022-12-13 08:38:05,424 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 18 treesize of output 20 [2022-12-13 08:38:05,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-12-13 08:38:05,659 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:38:05,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:05,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:38:05,867 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 248 treesize of output 276 [2022-12-13 08:38:05,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:38:05,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 168 [2022-12-13 08:38:11,438 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:38:11,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772575387] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:11,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:11,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 08:38:11,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5955804] [2022-12-13 08:38:11,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:11,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 08:38:11,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:11,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 08:38:11,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-13 08:38:11,448 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:38:11,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 442 transitions, 15215 flow. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:11,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:11,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:38:11,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:12,493 INFO L130 PetriNetUnfolder]: 388/789 cut-off events. [2022-12-13 08:38:12,493 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-13 08:38:12,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14310 conditions, 789 events. 388/789 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4105 event pairs, 0 based on Foata normal form. 1/709 useless extension candidates. Maximal degree in co-relation 4690. Up to 790 conditions per place. [2022-12-13 08:38:12,498 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 348 selfloop transitions, 71 changer transitions 22/441 dead transitions. [2022-12-13 08:38:12,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 441 transitions, 16063 flow [2022-12-13 08:38:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 08:38:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 08:38:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2022-12-13 08:38:12,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21454545454545454 [2022-12-13 08:38:12,512 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 116 predicate places. [2022-12-13 08:38:12,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 441 transitions, 16063 flow [2022-12-13 08:38:12,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 419 transitions, 15251 flow [2022-12-13 08:38:12,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:12,525 INFO L89 Accepts]: Start accepts. Operand has 113 places, 419 transitions, 15251 flow [2022-12-13 08:38:12,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:12,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:12,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 419 transitions, 15251 flow [2022-12-13 08:38:12,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 419 transitions, 15251 flow [2022-12-13 08:38:12,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:12,536 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:12,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 08:38:12,536 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 419 transitions, 15251 flow [2022-12-13 08:38:12,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:12,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:12,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:12,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 08:38:12,741 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,SelfDestructingSolverStorable16 [2022-12-13 08:38:12,741 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:38:12,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1462624166, now seen corresponding path program 1 times [2022-12-13 08:38:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:12,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792679878] [2022-12-13 08:38:12,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:13,470 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:38:13,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:13,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792679878] [2022-12-13 08:38:13,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792679878] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:13,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988645637] [2022-12-13 08:38:13,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:13,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:13,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:13,472 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:38:13,473 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:38:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:13,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 08:38:13,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:13,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:38:13,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 08:38:13,789 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 08:38:13,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 20 [2022-12-13 08:38:13,830 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:38:13,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:14,163 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-13 08:38:14,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 352 [2022-12-13 08:38:14,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:38:14,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 08:38:14,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:38:14,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 08:38:32,886 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:38:32,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988645637] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:32,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:32,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-13 08:38:32,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572739711] [2022-12-13 08:38:32,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:32,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 08:38:32,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:32,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 08:38:32,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2022-12-13 08:38:32,888 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 08:38:32,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 419 transitions, 15251 flow. Second operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:32,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:32,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 08:38:32,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:34,234 INFO L130 PetriNetUnfolder]: 435/879 cut-off events. [2022-12-13 08:38:34,235 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-13 08:38:34,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16813 conditions, 879 events. 435/879 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4733 event pairs, 0 based on Foata normal form. 3/792 useless extension candidates. Maximal degree in co-relation 4950. Up to 880 conditions per place. [2022-12-13 08:38:34,240 INFO L137 encePairwiseOnDemand]: 7/23 looper letters, 304 selfloop transitions, 148 changer transitions 38/490 dead transitions. [2022-12-13 08:38:34,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 490 transitions, 18823 flow [2022-12-13 08:38:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 08:38:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 08:38:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 128 transitions. [2022-12-13 08:38:34,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22260869565217392 [2022-12-13 08:38:34,255 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 115 predicate places. [2022-12-13 08:38:34,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 490 transitions, 18823 flow [2022-12-13 08:38:34,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 452 transitions, 17343 flow [2022-12-13 08:38:34,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:34,270 INFO L89 Accepts]: Start accepts. Operand has 133 places, 452 transitions, 17343 flow [2022-12-13 08:38:34,283 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:34,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:34,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 452 transitions, 17343 flow [2022-12-13 08:38:34,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 452 transitions, 17343 flow [2022-12-13 08:38:34,299 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:44,801 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 08:38:44,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10534 [2022-12-13 08:38:44,805 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 450 transitions, 17267 flow [2022-12-13 08:38:44,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:44,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:44,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:44,810 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:38:45,007 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,SelfDestructingSolverStorable17 [2022-12-13 08:38:45,007 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:38:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1846981966, now seen corresponding path program 1 times [2022-12-13 08:38:45,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:45,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884834064] [2022-12-13 08:38:45,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:45,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:45,838 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:38:45,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:45,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884834064] [2022-12-13 08:38:45,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884834064] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:45,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964338805] [2022-12-13 08:38:45,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:45,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:45,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:45,840 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:38:45,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 08:38:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:45,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 08:38:45,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:45,953 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 08:38:45,975 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 08:38:45,976 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 08:38:45,980 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 34 treesize of output 32 [2022-12-13 08:38:46,025 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 29 treesize of output 29 [2022-12-13 08:38:46,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 08:38:46,239 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:38:46,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:48,615 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:38:48,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964338805] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:48,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:48,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 08:38:48,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677205605] [2022-12-13 08:38:48,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:48,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 08:38:48,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:48,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 08:38:48,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-12-13 08:38:48,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 08:38:48,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 450 transitions, 17267 flow. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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:38:48,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:48,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 08:38:48,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:56,302 INFO L130 PetriNetUnfolder]: 454/918 cut-off events. [2022-12-13 08:38:56,303 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-13 08:38:56,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18468 conditions, 918 events. 454/918 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4989 event pairs, 0 based on Foata normal form. 3/831 useless extension candidates. Maximal degree in co-relation 5571. Up to 919 conditions per place. [2022-12-13 08:38:56,309 INFO L137 encePairwiseOnDemand]: 6/24 looper letters, 333 selfloop transitions, 162 changer transitions 16/511 dead transitions. [2022-12-13 08:38:56,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 511 transitions, 20625 flow [2022-12-13 08:38:56,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 08:38:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 08:38:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 114 transitions. [2022-12-13 08:38:56,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19791666666666666 [2022-12-13 08:38:56,311 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 128 predicate places. [2022-12-13 08:38:56,311 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 511 transitions, 20625 flow [2022-12-13 08:38:56,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 495 transitions, 19967 flow [2022-12-13 08:38:56,327 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:56,327 INFO L89 Accepts]: Start accepts. Operand has 149 places, 495 transitions, 19967 flow [2022-12-13 08:38:56,331 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:56,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:56,331 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 495 transitions, 19967 flow [2022-12-13 08:38:56,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 495 transitions, 19967 flow [2022-12-13 08:38:56,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:56,339 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:56,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 08:38:56,340 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 495 transitions, 19967 flow [2022-12-13 08:38:56,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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:38:56,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:56,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:56,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 08:38:56,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:56,546 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:38:56,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash -477615190, now seen corresponding path program 1 times [2022-12-13 08:38:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:56,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025290882] [2022-12-13 08:38:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:57,441 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:38:57,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:57,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025290882] [2022-12-13 08:38:57,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025290882] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:57,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561299761] [2022-12-13 08:38:57,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:57,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:57,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:57,443 INFO L229 MonitoredProcess]: Starting monitored process 14 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:38:57,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 08:38:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:57,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 08:38:57,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:57,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:38:57,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-12-13 08:38:57,771 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:38:57,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:58,105 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-12-13 08:38:58,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 236 [2022-12-13 08:39:01,016 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:39:01,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561299761] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:39:01,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:39:01,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 08:39:01,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141325685] [2022-12-13 08:39:01,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:39:01,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 08:39:01,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:01,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 08:39:01,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-12-13 08:39:01,017 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 08:39:01,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 495 transitions, 19967 flow. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:01,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:01,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 08:39:01,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:05,542 INFO L130 PetriNetUnfolder]: 560/1163 cut-off events. [2022-12-13 08:39:05,542 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-13 08:39:05,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24554 conditions, 1163 events. 560/1163 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6919 event pairs, 0 based on Foata normal form. 4/1047 useless extension candidates. Maximal degree in co-relation 7168. Up to 1164 conditions per place. [2022-12-13 08:39:05,553 INFO L137 encePairwiseOnDemand]: 6/24 looper letters, 406 selfloop transitions, 229 changer transitions 27/662 dead transitions. [2022-12-13 08:39:05,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 662 transitions, 28055 flow [2022-12-13 08:39:05,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 08:39:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-13 08:39:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 185 transitions. [2022-12-13 08:39:05,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19270833333333334 [2022-12-13 08:39:05,554 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 166 predicate places. [2022-12-13 08:39:05,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 662 transitions, 28055 flow [2022-12-13 08:39:05,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 635 transitions, 26894 flow [2022-12-13 08:39:05,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:05,579 INFO L89 Accepts]: Start accepts. Operand has 187 places, 635 transitions, 26894 flow [2022-12-13 08:39:05,583 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:05,584 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:05,584 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 635 transitions, 26894 flow [2022-12-13 08:39:05,594 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 635 transitions, 26894 flow [2022-12-13 08:39:05,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:39:05,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 08:39:05,653 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:39:05,654 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 08:39:05,654 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 634 transitions, 26854 flow [2022-12-13 08:39:05,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:05,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:05,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:05,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 08:39:05,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-12-13 08:39:05,862 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:39:05,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1700064882, now seen corresponding path program 2 times [2022-12-13 08:39:05,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:05,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620840346] [2022-12-13 08:39:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:05,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:06,847 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:39:06,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:06,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620840346] [2022-12-13 08:39:06,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620840346] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:39:06,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040293059] [2022-12-13 08:39:06,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:39:06,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:39:06,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:39:06,849 INFO L229 MonitoredProcess]: Starting monitored process 15 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:39:06,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 08:39:06,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:39:06,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:39:06,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 08:39:06,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:39:07,072 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 08:39:07,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2022-12-13 08:39:07,118 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:39:07,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:39:07,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:39:07,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 282 [2022-12-13 08:39:25,722 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:39:25,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040293059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:39:25,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:39:25,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 08:39:25,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137341675] [2022-12-13 08:39:25,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:39:25,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 08:39:25,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:25,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 08:39:25,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-12-13 08:39:25,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:39:25,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 634 transitions, 26854 flow. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:25,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:25,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:39:25,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:27,145 INFO L130 PetriNetUnfolder]: 731/1507 cut-off events. [2022-12-13 08:39:27,145 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-12-13 08:39:27,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33316 conditions, 1507 events. 731/1507 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9507 event pairs, 0 based on Foata normal form. 16/1353 useless extension candidates. Maximal degree in co-relation 7399. Up to 1508 conditions per place. [2022-12-13 08:39:27,155 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 580 selfloop transitions, 210 changer transitions 42/832 dead transitions. [2022-12-13 08:39:27,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 832 transitions, 36933 flow [2022-12-13 08:39:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 08:39:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 08:39:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 123 transitions. [2022-12-13 08:39:27,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21391304347826087 [2022-12-13 08:39:27,156 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 184 predicate places. [2022-12-13 08:39:27,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 832 transitions, 36933 flow [2022-12-13 08:39:27,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 790 transitions, 35037 flow [2022-12-13 08:39:27,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:27,184 INFO L89 Accepts]: Start accepts. Operand has 206 places, 790 transitions, 35037 flow [2022-12-13 08:39:27,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:27,190 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:27,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 790 transitions, 35037 flow [2022-12-13 08:39:27,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 790 transitions, 35037 flow [2022-12-13 08:39:27,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:39:27,205 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:39:27,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 08:39:27,205 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 790 transitions, 35037 flow [2022-12-13 08:39:27,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:27,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:27,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:27,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 08:39:27,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:39:27,411 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:39:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:27,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1010955174, now seen corresponding path program 1 times [2022-12-13 08:39:27,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:27,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056435430] [2022-12-13 08:39:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:27,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:28,724 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:39:28,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:28,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056435430] [2022-12-13 08:39:28,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056435430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:39:28,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821521119] [2022-12-13 08:39:28,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:28,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:39:28,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:39:28,727 INFO L229 MonitoredProcess]: Starting monitored process 16 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:39:28,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 08:39:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:28,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 08:39:28,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:39:28,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:39:28,879 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-13 08:39:28,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-13 08:39:28,898 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 13 treesize of output 12 [2022-12-13 08:39:28,905 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 22 treesize of output 21 [2022-12-13 08:39:28,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:39:28,924 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 25 [2022-12-13 08:39:28,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-13 08:39:28,933 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:39:28,934 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 120 [2022-12-13 08:39:29,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:39:29,184 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-12-13 08:39:29,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 257 treesize of output 255 [2022-12-13 08:39:29,197 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 204 treesize of output 197 [2022-12-13 08:39:29,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-13 08:39:29,463 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 08:39:29,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 08:39:29,521 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:39:29,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:39:29,868 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:39:29,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821521119] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:39:29,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:39:29,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 08:39:29,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344333080] [2022-12-13 08:39:29,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:39:29,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 08:39:29,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:29,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 08:39:29,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-12-13 08:39:29,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:39:29,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 790 transitions, 35037 flow. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:29,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:29,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:39:29,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:33,073 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:39:35,424 INFO L130 PetriNetUnfolder]: 785/1619 cut-off events. [2022-12-13 08:39:35,424 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-13 08:39:35,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37406 conditions, 1619 events. 785/1619 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 10397 event pairs, 0 based on Foata normal form. 4/1451 useless extension candidates. Maximal degree in co-relation 7712. Up to 1620 conditions per place. [2022-12-13 08:39:35,439 INFO L137 encePairwiseOnDemand]: 5/25 looper letters, 602 selfloop transitions, 258 changer transitions 30/890 dead transitions. [2022-12-13 08:39:35,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 890 transitions, 41289 flow [2022-12-13 08:39:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 08:39:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 08:39:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 141 transitions. [2022-12-13 08:39:35,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2088888888888889 [2022-12-13 08:39:35,442 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 210 predicate places. [2022-12-13 08:39:35,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 890 transitions, 41289 flow [2022-12-13 08:39:35,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 860 transitions, 39879 flow [2022-12-13 08:39:35,479 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:35,480 INFO L89 Accepts]: Start accepts. Operand has 229 places, 860 transitions, 39879 flow [2022-12-13 08:39:35,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:35,488 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:35,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 860 transitions, 39879 flow [2022-12-13 08:39:35,503 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 860 transitions, 39879 flow [2022-12-13 08:39:35,503 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:39:36,204 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:39:36,204 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 725 [2022-12-13 08:39:36,205 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 859 transitions, 39833 flow [2022-12-13 08:39:36,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:36,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:36,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:36,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 08:39:36,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:39:36,406 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:39:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1125446660, now seen corresponding path program 2 times [2022-12-13 08:39:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:36,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556131703] [2022-12-13 08:39:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:37,051 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:39:37,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:37,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556131703] [2022-12-13 08:39:37,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556131703] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:39:37,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001100913] [2022-12-13 08:39:37,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:39:37,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:39:37,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:39:37,053 INFO L229 MonitoredProcess]: Starting monitored process 17 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:39:37,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 08:39:37,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:39:37,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:39:37,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 08:39:37,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:39:37,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:39:37,209 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-12-13 08:39:37,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 100 [2022-12-13 08:39:37,218 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:39:37,248 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 12 treesize of output 11 [2022-12-13 08:39:37,259 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:39:37,260 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2022-12-13 08:39:37,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:39:37,326 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 08:39:37,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 20 [2022-12-13 08:39:37,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 08:39:37,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:39:37,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 08:39:37,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:39:37,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2022-12-13 08:39:37,536 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:39:37,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:39:37,828 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:39:37,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001100913] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:39:37,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:39:37,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 08:39:37,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046314648] [2022-12-13 08:39:37,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:39:37,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 08:39:37,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:37,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 08:39:37,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=389, Unknown=1, NotChecked=0, Total=462 [2022-12-13 08:39:37,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 08:39:37,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 859 transitions, 39833 flow. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:37,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:37,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 08:39:37,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:41,565 INFO L130 PetriNetUnfolder]: 781/1607 cut-off events. [2022-12-13 08:39:41,565 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-13 08:39:41,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38735 conditions, 1607 events. 781/1607 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10309 event pairs, 0 based on Foata normal form. 1/1451 useless extension candidates. Maximal degree in co-relation 8874. Up to 1608 conditions per place. [2022-12-13 08:39:41,662 INFO L137 encePairwiseOnDemand]: 6/27 looper letters, 582 selfloop transitions, 304 changer transitions 5/891 dead transitions. [2022-12-13 08:39:41,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 891 transitions, 43105 flow [2022-12-13 08:39:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 08:39:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 08:39:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 122 transitions. [2022-12-13 08:39:41,663 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1673525377229081 [2022-12-13 08:39:41,663 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 232 predicate places. [2022-12-13 08:39:41,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 254 places, 891 transitions, 43105 flow [2022-12-13 08:39:41,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 253 places, 886 transitions, 42859 flow [2022-12-13 08:39:41,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:41,693 INFO L89 Accepts]: Start accepts. Operand has 253 places, 886 transitions, 42859 flow [2022-12-13 08:39:41,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:41,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:41,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 886 transitions, 42859 flow [2022-12-13 08:39:41,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 253 places, 886 transitions, 42859 flow [2022-12-13 08:39:41,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:39:41,716 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:39:41,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 08:39:41,716 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 886 transitions, 42859 flow [2022-12-13 08:39:41,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:41,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:41,716 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:41,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 08:39:41,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 08:39:41,922 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:39:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash 811399398, now seen corresponding path program 3 times [2022-12-13 08:39:41,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:41,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298747856] [2022-12-13 08:39:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:42,632 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:39:42,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:42,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298747856] [2022-12-13 08:39:42,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298747856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:39:42,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475700906] [2022-12-13 08:39:42,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:39:42,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:39:42,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:39:42,634 INFO L229 MonitoredProcess]: Starting monitored process 18 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:39:42,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 08:39:42,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 08:39:42,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:39:42,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 08:39:42,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:39:42,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:39:42,793 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-13 08:39:42,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-13 08:39:42,802 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 13 treesize of output 12 [2022-12-13 08:39:42,808 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 22 treesize of output 21 [2022-12-13 08:39:42,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:39:42,831 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 08:39:42,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 30 [2022-12-13 08:39:42,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-13 08:39:42,839 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:39:42,840 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 91 [2022-12-13 08:39:42,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:39:42,989 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 08:39:42,989 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 141 [2022-12-13 08:39:43,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-13 08:39:43,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:39:43,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 08:39:43,257 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:39:43,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:39:43,553 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:39:43,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475700906] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:39:43,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:39:43,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 08:39:43,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828074956] [2022-12-13 08:39:43,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:39:43,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 08:39:43,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:43,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 08:39:43,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-12-13 08:39:43,555 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 08:39:43,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 886 transitions, 42859 flow. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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:39:43,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:43,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 08:39:43,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:45,766 INFO L130 PetriNetUnfolder]: 784/1614 cut-off events. [2022-12-13 08:39:45,767 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-13 08:39:45,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40520 conditions, 1614 events. 784/1614 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 10299 event pairs, 0 based on Foata normal form. 4/1463 useless extension candidates. Maximal degree in co-relation 8582. Up to 1615 conditions per place. [2022-12-13 08:39:45,777 INFO L137 encePairwiseOnDemand]: 6/27 looper letters, 597 selfloop transitions, 272 changer transitions 32/901 dead transitions. [2022-12-13 08:39:45,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 901 transitions, 45393 flow [2022-12-13 08:39:45,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 08:39:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 08:39:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 121 transitions. [2022-12-13 08:39:45,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16598079561042525 [2022-12-13 08:39:45,778 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 257 predicate places. [2022-12-13 08:39:45,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 901 transitions, 45393 flow [2022-12-13 08:39:45,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 869 transitions, 43769 flow [2022-12-13 08:39:45,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:45,807 INFO L89 Accepts]: Start accepts. Operand has 276 places, 869 transitions, 43769 flow [2022-12-13 08:39:45,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:45,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:45,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 869 transitions, 43769 flow [2022-12-13 08:39:45,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 869 transitions, 43769 flow [2022-12-13 08:39:45,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:39:45,829 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:39:45,829 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 08:39:45,829 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 869 transitions, 43769 flow [2022-12-13 08:39:45,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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:39:45,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:45,829 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:45,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 08:39:46,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:39:46,035 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:39:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash -458500580, now seen corresponding path program 3 times [2022-12-13 08:39:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:46,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869237622] [2022-12-13 08:39:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:46,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:47,262 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:39:47,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:47,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869237622] [2022-12-13 08:39:47,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869237622] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:39:47,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599491167] [2022-12-13 08:39:47,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:39:47,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:39:47,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:39:47,271 INFO L229 MonitoredProcess]: Starting monitored process 19 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:39:47,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 08:39:47,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 08:39:47,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:39:47,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 08:39:47,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:39:47,452 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 08:39:47,458 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 96 treesize of output 94 [2022-12-13 08:39:47,472 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 08:39:47,472 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 08:39:47,523 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:39:47,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:39:47,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 08:39:47,763 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:39:47,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:39:48,170 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:39:48,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599491167] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:39:48,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:39:48,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-13 08:39:48,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362120997] [2022-12-13 08:39:48,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:39:48,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 08:39:48,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:48,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 08:39:48,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=519, Unknown=5, NotChecked=0, Total=600 [2022-12-13 08:39:48,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 08:39:48,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 869 transitions, 43769 flow. Second operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:48,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:48,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 08:39:48,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:56,175 INFO L130 PetriNetUnfolder]: 846/1719 cut-off events. [2022-12-13 08:39:56,179 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-13 08:39:56,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44870 conditions, 1719 events. 846/1719 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11095 event pairs, 0 based on Foata normal form. 3/1559 useless extension candidates. Maximal degree in co-relation 10147. Up to 1720 conditions per place. [2022-12-13 08:39:56,209 INFO L137 encePairwiseOnDemand]: 7/27 looper letters, 625 selfloop transitions, 288 changer transitions 43/956 dead transitions. [2022-12-13 08:39:56,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 956 transitions, 50070 flow [2022-12-13 08:39:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 08:39:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 08:39:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 181 transitions. [2022-12-13 08:39:56,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18118118118118118 [2022-12-13 08:39:56,212 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 290 predicate places. [2022-12-13 08:39:56,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 956 transitions, 50070 flow [2022-12-13 08:39:56,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 913 transitions, 47795 flow [2022-12-13 08:39:56,249 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:56,249 INFO L89 Accepts]: Start accepts. Operand has 306 places, 913 transitions, 47795 flow [2022-12-13 08:39:56,256 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:56,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:56,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 306 places, 913 transitions, 47795 flow [2022-12-13 08:39:56,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 306 places, 913 transitions, 47795 flow [2022-12-13 08:39:56,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:39:56,276 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:39:56,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 08:39:56,278 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 913 transitions, 47795 flow [2022-12-13 08:39:56,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:56,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:56,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:56,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 08:39:56,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:39:56,483 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:39:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:56,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1548775681, now seen corresponding path program 1 times [2022-12-13 08:39:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:56,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875839440] [2022-12-13 08:39:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:56,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:57,546 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:39:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:57,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875839440] [2022-12-13 08:39:57,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875839440] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:39:57,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434955384] [2022-12-13 08:39:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:57,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:39:57,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:39:57,548 INFO L229 MonitoredProcess]: Starting monitored process 20 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:39:57,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 08:39:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:57,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 08:39:57,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:39:57,782 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 08:39:57,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 17 [2022-12-13 08:39:57,831 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:39:57,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:39:58,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:39:58,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 282 [2022-12-13 08:40:04,868 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:40:04,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434955384] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:04,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:04,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2022-12-13 08:40:04,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490805351] [2022-12-13 08:40:04,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:04,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 08:40:04,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:04,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 08:40:04,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-12-13 08:40:04,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 08:40:04,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 913 transitions, 47795 flow. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:04,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:04,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 08:40:04,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:07,088 INFO L130 PetriNetUnfolder]: 960/1946 cut-off events. [2022-12-13 08:40:07,088 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-13 08:40:07,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52740 conditions, 1946 events. 960/1946 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 12787 event pairs, 0 based on Foata normal form. 6/1755 useless extension candidates. Maximal degree in co-relation 13800. Up to 1947 conditions per place. [2022-12-13 08:40:07,103 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 747 selfloop transitions, 307 changer transitions 26/1080 dead transitions. [2022-12-13 08:40:07,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 1080 transitions, 58741 flow [2022-12-13 08:40:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 08:40:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 08:40:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 142 transitions. [2022-12-13 08:40:07,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2286634460547504 [2022-12-13 08:40:07,105 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 306 predicate places. [2022-12-13 08:40:07,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 328 places, 1080 transitions, 58741 flow [2022-12-13 08:40:07,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 328 places, 1054 transitions, 57313 flow [2022-12-13 08:40:07,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:07,160 INFO L89 Accepts]: Start accepts. Operand has 328 places, 1054 transitions, 57313 flow [2022-12-13 08:40:07,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:07,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:07,171 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 328 places, 1054 transitions, 57313 flow [2022-12-13 08:40:07,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 328 places, 1054 transitions, 57313 flow [2022-12-13 08:40:07,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:07,193 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:07,193 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 08:40:07,193 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 1054 transitions, 57313 flow [2022-12-13 08:40:07,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:07,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:07,193 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:07,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:07,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:07,398 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:07,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:07,398 INFO L85 PathProgramCache]: Analyzing trace with hash -177475197, now seen corresponding path program 1 times [2022-12-13 08:40:07,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:07,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823885074] [2022-12-13 08:40:07,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:07,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:07,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823885074] [2022-12-13 08:40:07,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823885074] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:07,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506461762] [2022-12-13 08:40:07,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:07,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:07,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:07,475 INFO L229 MonitoredProcess]: Starting monitored process 21 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:40:07,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 08:40:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:07,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 08:40:07,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:07,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:07,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506461762] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:07,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:07,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 08:40:07,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943603864] [2022-12-13 08:40:07,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:07,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 08:40:07,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:07,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 08:40:07,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-13 08:40:07,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 08:40:07,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 1054 transitions, 57313 flow. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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:40:07,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:07,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 08:40:07,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:09,022 INFO L130 PetriNetUnfolder]: 950/2036 cut-off events. [2022-12-13 08:40:09,023 INFO L131 PetriNetUnfolder]: For 244/244 co-relation queries the response was YES. [2022-12-13 08:40:09,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57221 conditions, 2036 events. 950/2036 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14114 event pairs, 0 based on Foata normal form. 122/1925 useless extension candidates. Maximal degree in co-relation 21046. Up to 2037 conditions per place. [2022-12-13 08:40:09,041 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 817 selfloop transitions, 93 changer transitions 205/1115 dead transitions. [2022-12-13 08:40:09,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 1115 transitions, 62900 flow [2022-12-13 08:40:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:40:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:40:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-12-13 08:40:09,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-13 08:40:09,042 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 306 predicate places. [2022-12-13 08:40:09,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 328 places, 1115 transitions, 62900 flow [2022-12-13 08:40:09,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 910 transitions, 51406 flow [2022-12-13 08:40:09,084 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:09,084 INFO L89 Accepts]: Start accepts. Operand has 262 places, 910 transitions, 51406 flow [2022-12-13 08:40:09,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:09,093 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:09,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 910 transitions, 51406 flow [2022-12-13 08:40:09,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 262 places, 910 transitions, 51406 flow [2022-12-13 08:40:09,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:09,113 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:09,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 08:40:09,114 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 910 transitions, 51406 flow [2022-12-13 08:40:09,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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:40:09,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:09,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:09,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:09,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 08:40:09,318 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:09,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1269455271, now seen corresponding path program 1 times [2022-12-13 08:40:09,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:09,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38479316] [2022-12-13 08:40:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:09,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:10,559 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:40:10,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:10,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38479316] [2022-12-13 08:40:10,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38479316] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:10,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719532234] [2022-12-13 08:40:10,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:10,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:10,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:10,561 INFO L229 MonitoredProcess]: Starting monitored process 22 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:40:10,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 08:40:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:10,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 08:40:10,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:10,701 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 96 treesize of output 94 [2022-12-13 08:40:10,707 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 14 treesize of output 14 [2022-12-13 08:40:10,713 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:40:10,758 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:40:10,823 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:40:10,987 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:10,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 08:40:11,090 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:40:11,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:11,716 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:40:11,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719532234] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:11,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:11,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-13 08:40:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025507367] [2022-12-13 08:40:11,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:11,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 08:40:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 08:40:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=642, Unknown=10, NotChecked=0, Total=756 [2022-12-13 08:40:11,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:40:11,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 910 transitions, 51406 flow. Second operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 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:40:11,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:11,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:40:11,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:17,932 INFO L130 PetriNetUnfolder]: 904/1904 cut-off events. [2022-12-13 08:40:17,932 INFO L131 PetriNetUnfolder]: For 276/276 co-relation queries the response was YES. [2022-12-13 08:40:17,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55455 conditions, 1904 events. 904/1904 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12831 event pairs, 0 based on Foata normal form. 3/1707 useless extension candidates. Maximal degree in co-relation 21041. Up to 1905 conditions per place. [2022-12-13 08:40:17,948 INFO L137 encePairwiseOnDemand]: 7/25 looper letters, 735 selfloop transitions, 298 changer transitions 23/1056 dead transitions. [2022-12-13 08:40:17,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 1056 transitions, 61775 flow [2022-12-13 08:40:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 08:40:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-13 08:40:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 181 transitions. [2022-12-13 08:40:17,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2193939393939394 [2022-12-13 08:40:17,949 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 272 predicate places. [2022-12-13 08:40:17,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 1056 transitions, 61775 flow [2022-12-13 08:40:17,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 1033 transitions, 60417 flow [2022-12-13 08:40:17,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:17,994 INFO L89 Accepts]: Start accepts. Operand has 292 places, 1033 transitions, 60417 flow [2022-12-13 08:40:18,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:18,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:18,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 292 places, 1033 transitions, 60417 flow [2022-12-13 08:40:18,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 292 places, 1033 transitions, 60417 flow [2022-12-13 08:40:18,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:22,692 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:40:22,693 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4699 [2022-12-13 08:40:22,693 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 1032 transitions, 60359 flow [2022-12-13 08:40:22,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 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:40:22,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:22,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:22,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:22,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 08:40:22,894 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:22,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:22,894 INFO L85 PathProgramCache]: Analyzing trace with hash -260404484, now seen corresponding path program 1 times [2022-12-13 08:40:22,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:22,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92274284] [2022-12-13 08:40:22,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:23,617 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:40:23,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:23,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92274284] [2022-12-13 08:40:23,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92274284] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:23,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444914517] [2022-12-13 08:40:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:23,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:23,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:23,619 INFO L229 MonitoredProcess]: Starting monitored process 23 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:40:23,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 08:40:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:23,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 08:40:23,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:23,756 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 08:40:23,762 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 414 treesize of output 406 [2022-12-13 08:40:23,798 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 08:40:23,799 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 08:40:23,879 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:40:24,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:24,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 08:40:24,092 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:40:24,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:24,667 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:40:24,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444914517] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:24,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:24,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-13 08:40:24,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796524455] [2022-12-13 08:40:24,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:24,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 08:40:24,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:24,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 08:40:24,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=476, Unknown=2, NotChecked=0, Total=552 [2022-12-13 08:40:24,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 08:40:24,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 1032 transitions, 60359 flow. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 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:40:24,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:24,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 08:40:24,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:28,079 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:40:34,480 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 65 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:40:39,065 INFO L130 PetriNetUnfolder]: 915/1925 cut-off events. [2022-12-13 08:40:39,065 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2022-12-13 08:40:39,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57991 conditions, 1925 events. 915/1925 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13003 event pairs, 0 based on Foata normal form. 8/1727 useless extension candidates. Maximal degree in co-relation 21765. Up to 1926 conditions per place. [2022-12-13 08:40:39,081 INFO L137 encePairwiseOnDemand]: 7/26 looper letters, 747 selfloop transitions, 281 changer transitions 36/1064 dead transitions. [2022-12-13 08:40:39,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1064 transitions, 64370 flow [2022-12-13 08:40:39,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 08:40:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 08:40:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 166 transitions. [2022-12-13 08:40:39,083 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18778280542986425 [2022-12-13 08:40:39,084 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 302 predicate places. [2022-12-13 08:40:39,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 324 places, 1064 transitions, 64370 flow [2022-12-13 08:40:39,115 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 1028 transitions, 62183 flow [2022-12-13 08:40:39,130 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:39,131 INFO L89 Accepts]: Start accepts. Operand has 311 places, 1028 transitions, 62183 flow [2022-12-13 08:40:39,141 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:39,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:39,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 1028 transitions, 62183 flow [2022-12-13 08:40:39,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 1028 transitions, 62183 flow [2022-12-13 08:40:39,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:39,165 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:39,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 08:40:39,166 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 1028 transitions, 62183 flow [2022-12-13 08:40:39,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 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:40:39,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:39,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:39,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 08:40:39,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 08:40:39,371 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:39,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1078843086, now seen corresponding path program 2 times [2022-12-13 08:40:39,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:39,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246750199] [2022-12-13 08:40:39,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:39,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:40,568 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:40:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:40,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246750199] [2022-12-13 08:40:40,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246750199] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:40,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042864258] [2022-12-13 08:40:40,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:40:40,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:40,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:40,570 INFO L229 MonitoredProcess]: Starting monitored process 24 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:40:40,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 08:40:40,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:40:40,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:40,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 08:40:40,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:40,732 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 08:40:40,738 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 202 treesize of output 198 [2022-12-13 08:40:40,751 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 08:40:40,752 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 08:40:40,789 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:40:40,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:40,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 08:40:41,007 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:40:41,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:41,453 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:40:41,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042864258] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:41,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:41,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-13 08:40:41,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201918733] [2022-12-13 08:40:41,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:41,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 08:40:41,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 08:40:41,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=509, Unknown=5, NotChecked=0, Total=600 [2022-12-13 08:40:41,455 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 08:40:41,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 1028 transitions, 62183 flow. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 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:40:41,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:41,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 08:40:41,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:44,385 INFO L130 PetriNetUnfolder]: 902/1875 cut-off events. [2022-12-13 08:40:44,385 INFO L131 PetriNetUnfolder]: For 264/264 co-relation queries the response was YES. [2022-12-13 08:40:44,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58358 conditions, 1875 events. 902/1875 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12406 event pairs, 0 based on Foata normal form. 1/1674 useless extension candidates. Maximal degree in co-relation 18761. Up to 1876 conditions per place. [2022-12-13 08:40:44,401 INFO L137 encePairwiseOnDemand]: 7/26 looper letters, 696 selfloop transitions, 317 changer transitions 19/1032 dead transitions. [2022-12-13 08:40:44,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1032 transitions, 64487 flow [2022-12-13 08:40:44,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 08:40:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 08:40:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 107 transitions. [2022-12-13 08:40:44,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1646153846153846 [2022-12-13 08:40:44,402 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 313 predicate places. [2022-12-13 08:40:44,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 335 places, 1032 transitions, 64487 flow [2022-12-13 08:40:44,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 323 places, 1013 transitions, 63297 flow [2022-12-13 08:40:44,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:44,446 INFO L89 Accepts]: Start accepts. Operand has 323 places, 1013 transitions, 63297 flow [2022-12-13 08:40:44,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:44,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:44,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 323 places, 1013 transitions, 63297 flow [2022-12-13 08:40:44,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 323 places, 1013 transitions, 63297 flow [2022-12-13 08:40:44,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:44,478 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 08:40:44,526 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:40:44,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-13 08:40:44,526 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 1012 transitions, 63237 flow [2022-12-13 08:40:44,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 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:40:44,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:44,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:44,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 08:40:44,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:44,732 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1070980132, now seen corresponding path program 1 times [2022-12-13 08:40:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:44,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549953312] [2022-12-13 08:40:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:45,546 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:40:45,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:45,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549953312] [2022-12-13 08:40:45,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549953312] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:45,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719771556] [2022-12-13 08:40:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:45,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:45,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:45,550 INFO L229 MonitoredProcess]: Starting monitored process 25 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:40:45,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 08:40:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:45,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 08:40:45,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:45,711 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 08:40:45,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:40:45,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:40:45,719 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 18 treesize of output 16 [2022-12-13 08:40:45,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:40:45,733 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 9 treesize of output 11 [2022-12-13 08:40:45,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:40:45,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 08:40:45,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:45,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 08:40:46,027 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:40:46,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:46,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:40:46,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719771556] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:46,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:46,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-13 08:40:46,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884190764] [2022-12-13 08:40:46,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:46,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 08:40:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:46,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 08:40:46,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-12-13 08:40:46,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 08:40:46,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 1012 transitions, 63237 flow. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 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:40:46,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:46,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 08:40:46,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:50,157 INFO L130 PetriNetUnfolder]: 909/1891 cut-off events. [2022-12-13 08:40:50,157 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2022-12-13 08:40:50,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60748 conditions, 1891 events. 909/1891 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12584 event pairs, 0 based on Foata normal form. 2/1691 useless extension candidates. Maximal degree in co-relation 23213. Up to 1892 conditions per place. [2022-12-13 08:40:50,174 INFO L137 encePairwiseOnDemand]: 8/27 looper letters, 744 selfloop transitions, 273 changer transitions 21/1038 dead transitions. [2022-12-13 08:40:50,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 1038 transitions, 66943 flow [2022-12-13 08:40:50,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 08:40:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 08:40:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-12-13 08:40:50,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19825708061002179 [2022-12-13 08:40:50,175 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 314 predicate places. [2022-12-13 08:40:50,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 336 places, 1038 transitions, 66943 flow [2022-12-13 08:40:50,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 332 places, 1017 transitions, 65584 flow [2022-12-13 08:40:50,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:50,222 INFO L89 Accepts]: Start accepts. Operand has 332 places, 1017 transitions, 65584 flow [2022-12-13 08:40:50,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:50,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:50,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 332 places, 1017 transitions, 65584 flow [2022-12-13 08:40:50,255 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 332 places, 1017 transitions, 65584 flow [2022-12-13 08:40:50,255 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:50,257 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:50,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 08:40:50,257 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 1017 transitions, 65584 flow [2022-12-13 08:40:50,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 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:40:50,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:50,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:50,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:50,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:50,463 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:50,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash -871424356, now seen corresponding path program 2 times [2022-12-13 08:40:50,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:50,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157120293] [2022-12-13 08:40:50,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:50,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:51,367 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:40:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157120293] [2022-12-13 08:40:51,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157120293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19280589] [2022-12-13 08:40:51,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:40:51,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:51,369 INFO L229 MonitoredProcess]: Starting monitored process 26 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:40:51,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 08:40:51,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:40:51,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:40:51,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 08:40:51,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:51,523 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 08:40:51,529 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 34 treesize of output 32 [2022-12-13 08:40:51,543 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 08:40:51,543 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 08:40:51,608 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 29 treesize of output 29 [2022-12-13 08:40:51,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 22 [2022-12-13 08:40:51,835 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:40:51,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:52,186 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:40:52,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19280589] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:52,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:52,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 08:40:52,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338747940] [2022-12-13 08:40:52,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:52,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 08:40:52,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:52,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 08:40:52,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-12-13 08:40:52,187 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 08:40:52,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 1017 transitions, 65584 flow. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:52,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:52,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 08:40:52,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:56,271 INFO L130 PetriNetUnfolder]: 909/1886 cut-off events. [2022-12-13 08:40:56,272 INFO L131 PetriNetUnfolder]: For 273/273 co-relation queries the response was YES. [2022-12-13 08:40:56,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62474 conditions, 1886 events. 909/1886 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12540 event pairs, 0 based on Foata normal form. 1/1685 useless extension candidates. Maximal degree in co-relation 23937. Up to 1887 conditions per place. [2022-12-13 08:40:56,287 INFO L137 encePairwiseOnDemand]: 9/27 looper letters, 877 selfloop transitions, 132 changer transitions 25/1034 dead transitions. [2022-12-13 08:40:56,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1034 transitions, 68752 flow [2022-12-13 08:40:56,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 08:40:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 08:40:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-12-13 08:40:56,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20797720797720798 [2022-12-13 08:40:56,289 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 322 predicate places. [2022-12-13 08:40:56,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 344 places, 1034 transitions, 68752 flow [2022-12-13 08:40:56,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 337 places, 1009 transitions, 67082 flow [2022-12-13 08:40:56,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:56,333 INFO L89 Accepts]: Start accepts. Operand has 337 places, 1009 transitions, 67082 flow [2022-12-13 08:40:56,345 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:56,345 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:56,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 337 places, 1009 transitions, 67082 flow [2022-12-13 08:40:56,365 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 337 places, 1009 transitions, 67082 flow [2022-12-13 08:40:56,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:56,367 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:56,368 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 08:40:56,368 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 1009 transitions, 67082 flow [2022-12-13 08:40:56,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:56,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:56,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:56,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 08:40:56,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-13 08:40:56,574 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:40:56,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:56,574 INFO L85 PathProgramCache]: Analyzing trace with hash -836509528, now seen corresponding path program 1 times [2022-12-13 08:40:56,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:56,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209217041] [2022-12-13 08:40:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:56,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:57,139 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:40:57,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:57,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209217041] [2022-12-13 08:40:57,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209217041] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:57,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337316709] [2022-12-13 08:40:57,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:57,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:57,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:57,141 INFO L229 MonitoredProcess]: Starting monitored process 27 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:40:57,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 08:40:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:57,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 08:40:57,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:57,378 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 19 treesize of output 19 [2022-12-13 08:40:57,381 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:40:57,420 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:40:57,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:57,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 08:40:57,636 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:40:57,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:58,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:58,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 161 [2022-12-13 08:40:58,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:58,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1063 treesize of output 1200 [2022-12-13 08:40:58,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:58,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 951 treesize of output 944 [2022-12-13 08:40:58,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:58,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 855 treesize of output 984 [2022-12-13 08:40:58,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:40:58,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 771 treesize of output 788 Received shutdown request... [2022-12-13 08:48:03,924 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 08:48:03,926 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:48:03,926 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:48:03,926 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 08:48:03,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 08:48:04,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-13 08:48:04,132 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 17 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 0ms.. [2022-12-13 08:48:04,133 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 08:48:04,133 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 08:48:04,133 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:48:04,135 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:48:04,135 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:48:04,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:48:04 BasicIcfg [2022-12-13 08:48:04,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:48:04,137 INFO L158 Benchmark]: Toolchain (without parser) took 847384.61ms. Allocated memory was 221.2MB in the beginning and 1.1GB in the end (delta: 885.0MB). Free memory was 197.8MB in the beginning and 608.0MB in the end (delta: -410.2MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-13 08:48:04,137 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 221.2MB. Free memory was 197.7MB in the beginning and 197.6MB in the end (delta: 90.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:48:04,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.28ms. Allocated memory is still 221.2MB. Free memory was 197.3MB in the beginning and 185.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 08:48:04,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.84ms. Allocated memory is still 221.2MB. Free memory was 184.7MB in the beginning and 182.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:48:04,138 INFO L158 Benchmark]: Boogie Preprocessor took 37.70ms. Allocated memory is still 221.2MB. Free memory was 182.6MB in the beginning and 181.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 08:48:04,138 INFO L158 Benchmark]: RCFGBuilder took 648.73ms. Allocated memory is still 221.2MB. Free memory was 181.1MB in the beginning and 152.2MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 08:48:04,138 INFO L158 Benchmark]: TraceAbstraction took 846436.93ms. Allocated memory was 221.2MB in the beginning and 1.1GB in the end (delta: 885.0MB). Free memory was 151.2MB in the beginning and 608.0MB in the end (delta: -456.8MB). Peak memory consumption was 965.5MB. Max. memory is 8.0GB. [2022-12-13 08:48:04,139 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 221.2MB. Free memory was 197.7MB in the beginning and 197.6MB in the end (delta: 90.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.28ms. Allocated memory is still 221.2MB. Free memory was 197.3MB in the beginning and 185.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.84ms. Allocated memory is still 221.2MB. Free memory was 184.7MB in the beginning and 182.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.70ms. Allocated memory is still 221.2MB. Free memory was 182.6MB in the beginning and 181.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 648.73ms. Allocated memory is still 221.2MB. Free memory was 181.1MB in the beginning and 152.2MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 846436.93ms. Allocated memory was 221.2MB in the beginning and 1.1GB in the end (delta: 885.0MB). Free memory was 151.2MB in the beginning and 608.0MB in the end (delta: -456.8MB). Peak memory consumption was 965.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 147 PlacesBefore, 22 PlacesAfterwards, 153 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 106 TrivialYvCompositions, 19 ConcurrentYvCompositions, 9 ChoiceCompositions, 134 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 301, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 294, independent: 286, independent conditional: 0, independent unconditional: 286, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 294, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 294, unknown conditional: 0, unknown unconditional: 294] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 469, Positive conditional cache size: 0, Positive unconditional cache size: 469, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, 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, 24 PlacesBefore, 24 PlacesAfterwards, 30 TransitionsBefore, 30 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, 27 PlacesBefore, 27 PlacesAfterwards, 34 TransitionsBefore, 34 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, 31 PlacesBefore, 31 PlacesAfterwards, 42 TransitionsBefore, 42 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.3s, 33 PlacesBefore, 32 PlacesAfterwards, 43 TransitionsBefore, 42 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, 40 PlacesBefore, 40 PlacesAfterwards, 72 TransitionsBefore, 72 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, 41 PlacesBefore, 41 PlacesAfterwards, 65 TransitionsBefore, 65 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.9s, 43 PlacesBefore, 42 PlacesAfterwards, 66 TransitionsBefore, 65 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: 6.9s, 88 PlacesBefore, 85 PlacesAfterwards, 326 TransitionsBefore, 323 TransitionsAfterwards, 0 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.1s, 110 PlacesBefore, 109 PlacesAfterwards, 411 TransitionsBefore, 410 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.6s, 108 PlacesBefore, 105 PlacesAfterwards, 316 TransitionsBefore, 313 TransitionsAfterwards, 0 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.5s, 142 PlacesBefore, 141 PlacesAfterwards, 497 TransitionsBefore, 496 TransitionsAfterwards, 0 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: 1.5s, 171 PlacesBefore, 166 PlacesAfterwards, 617 TransitionsBefore, 613 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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.3s, 200 PlacesBefore, 199 PlacesAfterwards, 879 TransitionsBefore, 878 TransitionsAfterwards, 0 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, 217 PlacesBefore, 217 PlacesAfterwards, 919 TransitionsBefore, 919 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, 183 PlacesBefore, 183 PlacesAfterwards, 580 TransitionsBefore, 580 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.1s, 133 PlacesBefore, 129 PlacesAfterwards, 443 TransitionsBefore, 442 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, 113 PlacesBefore, 113 PlacesAfterwards, 419 TransitionsBefore, 419 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: 10.5s, 133 PlacesBefore, 127 PlacesAfterwards, 452 TransitionsBefore, 450 TransitionsAfterwards, 0 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, 149 PlacesBefore, 149 PlacesAfterwards, 495 TransitionsBefore, 495 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.1s, 187 PlacesBefore, 186 PlacesAfterwards, 635 TransitionsBefore, 634 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, 206 PlacesBefore, 206 PlacesAfterwards, 790 TransitionsBefore, 790 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.7s, 229 PlacesBefore, 228 PlacesAfterwards, 860 TransitionsBefore, 859 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, 253 PlacesBefore, 253 PlacesAfterwards, 886 TransitionsBefore, 886 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, 276 PlacesBefore, 276 PlacesAfterwards, 869 TransitionsBefore, 869 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, 306 PlacesBefore, 306 PlacesAfterwards, 913 TransitionsBefore, 913 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, 328 PlacesBefore, 328 PlacesAfterwards, 1054 TransitionsBefore, 1054 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, 262 PlacesBefore, 262 PlacesAfterwards, 910 TransitionsBefore, 910 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: 4.7s, 292 PlacesBefore, 291 PlacesAfterwards, 1033 TransitionsBefore, 1032 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, 311 PlacesBefore, 311 PlacesAfterwards, 1028 TransitionsBefore, 1028 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, 323 PlacesBefore, 320 PlacesAfterwards, 1013 TransitionsBefore, 1012 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, 332 PlacesBefore, 332 PlacesAfterwards, 1017 TransitionsBefore, 1017 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, 337 PlacesBefore, 337 PlacesAfterwards, 1009 TransitionsBefore, 1009 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: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 17 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 0ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 17 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 0ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 17 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 171 locations, 3 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: 846.3s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 275.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 174 mSolverCounterUnknown, 3967 SdHoareTripleChecker+Valid, 65.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3967 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 63.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 124 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1386 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18912 IncrementalHoareTripleChecker+Invalid, 20596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1386 mSolverCounterUnsat, 0 mSDtfsCounter, 18912 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1313 GetRequests, 361 SyntacticMatches, 23 SemanticMatches, 929 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8381 ImplicationChecksByTransitivity, 211.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67082occurred in iteration=32, InterpolantAutomatonStates: 656, 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.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 100.5s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 1099 ConstructedInterpolants, 125 QuantifiedInterpolants, 42769 SizeOfPredicates, 497 NumberOfNonLiveVariables, 5728 ConjunctsInSsa, 1008 ConjunctsInUnsatCore, 80 InterpolantComputations, 9 PerfectInterpolantSequences, 30/170 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