/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:19:28,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:19:28,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:19:28,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:19:28,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:19:28,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:19:28,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:19:28,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:19:28,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:19:28,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:19:28,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:19:28,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:19:28,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:19:28,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:19:28,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:19:28,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:19:28,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:19:28,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:19:28,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:19:28,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:19:28,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:19:28,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:19:28,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:19:28,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:19:28,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:19:28,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:19:28,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:19:28,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:19:28,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:19:28,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:19:28,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:19:28,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:19:28,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:19:28,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:19:28,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:19:28,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:19:28,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:19:28,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:19:28,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:19:28,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:19:28,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:19:28,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:19:28,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:19:28,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:19:28,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:19:28,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:19:28,278 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:19:28,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:19:28,279 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:19:28,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:19:28,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:19:28,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:19:28,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:19:28,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:19:28,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:19:28,281 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:19:28,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:19:28,281 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:19:28,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:19:28,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:19:28,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:19:28,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:19:28,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:19:28,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:19:28,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:19:28,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:19:28,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:19:28,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:19:28,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:19:28,283 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:19:28,284 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 [2022-12-06 07:19:28,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:19:28,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:19:28,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:19:28,654 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:19:28,654 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:19:28,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2022-12-06 07:19:29,790 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:19:30,055 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:19:30,056 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2022-12-06 07:19:30,065 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b280f9a/ec1ae09872a64a76956cce94b20411ae/FLAGa80108735 [2022-12-06 07:19:30,083 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b280f9a/ec1ae09872a64a76956cce94b20411ae [2022-12-06 07:19:30,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:19:30,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:19:30,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:19:30,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:19:30,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:19:30,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d251daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30, skipping insertion in model container [2022-12-06 07:19:30,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:19:30,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:19:30,277 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/chl-node-trans.wvr.c[3945,3958] [2022-12-06 07:19:30,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:19:30,298 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:19:30,320 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/chl-node-trans.wvr.c[3945,3958] [2022-12-06 07:19:30,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:19:30,338 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:19:30,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30 WrapperNode [2022-12-06 07:19:30,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:19:30,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:19:30,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:19:30,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:19:30,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,388 INFO L138 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 413 [2022-12-06 07:19:30,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:19:30,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:19:30,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:19:30,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:19:30,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,436 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:19:30,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:19:30,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:19:30,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:19:30,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (1/1) ... [2022-12-06 07:19:30,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:19:30,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:19:30,472 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-06 07:19:30,477 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-06 07:19:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:19:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:19:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:19:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:19:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:19:30,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:19:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:19:30,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:19:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:19:30,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:19:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:19:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:19:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:19:30,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:19:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:19:30,504 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:19:30,607 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:19:30,609 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:19:31,204 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:19:31,214 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:19:31,215 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 07:19:31,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:19:31 BoogieIcfgContainer [2022-12-06 07:19:31,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:19:31,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:19:31,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:19:31,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:19:31,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:19:30" (1/3) ... [2022-12-06 07:19:31,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cb7f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:19:31, skipping insertion in model container [2022-12-06 07:19:31,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:19:30" (2/3) ... [2022-12-06 07:19:31,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cb7f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:19:31, skipping insertion in model container [2022-12-06 07:19:31,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:19:31" (3/3) ... [2022-12-06 07:19:31,223 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2022-12-06 07:19:31,239 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:19:31,239 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:19:31,239 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:19:31,352 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:19:31,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 452 places, 483 transitions, 990 flow [2022-12-06 07:19:31,630 INFO L130 PetriNetUnfolder]: 41/480 cut-off events. [2022-12-06 07:19:31,630 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:19:31,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 480 events. 41/480 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 632 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 406. Up to 2 conditions per place. [2022-12-06 07:19:31,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 452 places, 483 transitions, 990 flow [2022-12-06 07:19:31,650 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 470 transitions, 958 flow [2022-12-06 07:19:31,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:31,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-06 07:19:31,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 470 transitions, 958 flow [2022-12-06 07:19:31,775 INFO L130 PetriNetUnfolder]: 41/470 cut-off events. [2022-12-06 07:19:31,776 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:19:31,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 470 events. 41/470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 630 event pairs, 0 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 406. Up to 2 conditions per place. [2022-12-06 07:19:31,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-06 07:19:31,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 17280 [2022-12-06 07:19:49,941 INFO L203 LiptonReduction]: Total number of compositions: 429 [2022-12-06 07:19:49,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:19:49,959 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;@3ebf7810, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:19:49,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:19:49,967 INFO L130 PetriNetUnfolder]: 10/41 cut-off events. [2022-12-06 07:19:49,967 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:19:49,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:49,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:49,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:49,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash -237819189, now seen corresponding path program 1 times [2022-12-06 07:19:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:49,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011137735] [2022-12-06 07:19:49,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:50,337 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-06 07:19:50,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:50,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011137735] [2022-12-06 07:19:50,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011137735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:50,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:50,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923553016] [2022-12-06 07:19:50,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:50,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:19:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:50,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:19:50,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:19:50,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:50,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:50,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:50,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:50,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:50,625 INFO L130 PetriNetUnfolder]: 727/1071 cut-off events. [2022-12-06 07:19:50,625 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-06 07:19:50,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 1071 events. 727/1071 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4030 event pairs, 405 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 2079. Up to 795 conditions per place. [2022-12-06 07:19:50,632 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 52 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2022-12-06 07:19:50,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 246 flow [2022-12-06 07:19:50,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:19:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:19:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 07:19:50,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2022-12-06 07:19:50,644 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 102 flow. Second operand 3 states and 59 transitions. [2022-12-06 07:19:50,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 246 flow [2022-12-06 07:19:50,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 230 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:19:50,651 INFO L231 Difference]: Finished difference. Result has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:50,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=43} [2022-12-06 07:19:50,658 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-06 07:19:50,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:50,659 INFO L89 Accepts]: Start accepts. Operand has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:50,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:50,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:50,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:50,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:50,678 INFO L130 PetriNetUnfolder]: 10/43 cut-off events. [2022-12-06 07:19:50,679 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:19:50,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 43 events. 10/43 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2022-12-06 07:19:50,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:50,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 07:19:50,717 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:50,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 07:19:50,719 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:50,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:50,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:50,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:50,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:19:50,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2107721905, now seen corresponding path program 1 times [2022-12-06 07:19:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:50,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223322713] [2022-12-06 07:19:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:50,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:50,875 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-06 07:19:50,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:50,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223322713] [2022-12-06 07:19:50,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223322713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:50,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:50,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:50,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213304059] [2022-12-06 07:19:50,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:50,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:19:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:50,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:19:50,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:19:50,884 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:50,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 43 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-06 07:19:50,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:50,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:50,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:51,113 INFO L130 PetriNetUnfolder]: 835/1231 cut-off events. [2022-12-06 07:19:51,114 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2022-12-06 07:19:51,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 1231 events. 835/1231 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4580 event pairs, 445 based on Foata normal form. 0/1116 useless extension candidates. Maximal degree in co-relation 1476. Up to 857 conditions per place. [2022-12-06 07:19:51,123 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 55 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-12-06 07:19:51,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 274 flow [2022-12-06 07:19:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:19:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:19:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 07:19:51,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 07:19:51,126 INFO L175 Difference]: Start difference. First operand has 40 places, 43 transitions, 108 flow. Second operand 3 states and 60 transitions. [2022-12-06 07:19:51,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 274 flow [2022-12-06 07:19:51,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:19:51,130 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:51,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2022-12-06 07:19:51,131 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 07:19:51,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:51,131 INFO L89 Accepts]: Start accepts. Operand has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:51,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:51,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:51,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:51,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:51,141 INFO L130 PetriNetUnfolder]: 10/44 cut-off events. [2022-12-06 07:19:51,142 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:19:51,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 44 events. 10/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2022-12-06 07:19:51,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:51,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:51,144 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:51,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:19:51,146 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:51,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-06 07:19:51,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:51,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:51,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:19:51,147 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:51,148 INFO L85 PathProgramCache]: Analyzing trace with hash 865441644, now seen corresponding path program 1 times [2022-12-06 07:19:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:51,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685673234] [2022-12-06 07:19:51,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:51,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:51,367 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-06 07:19:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:51,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685673234] [2022-12-06 07:19:51,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685673234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:51,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:51,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:19:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824467456] [2022-12-06 07:19:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:51,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:19:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:51,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:19:51,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:19:51,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:51,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-06 07:19:51,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:51,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:51,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:51,550 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 07:19:51,550 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2022-12-06 07:19:51,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3167 conditions, 1232 events. 835/1232 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4559 event pairs, 637 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 1604. Up to 1229 conditions per place. [2022-12-06 07:19:51,557 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 42 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-06 07:19:51,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 210 flow [2022-12-06 07:19:51,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:19:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:19:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 07:19:51,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-06 07:19:51,559 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 120 flow. Second operand 3 states and 46 transitions. [2022-12-06 07:19:51,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 210 flow [2022-12-06 07:19:51,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:19:51,562 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 126 flow [2022-12-06 07:19:51,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2022-12-06 07:19:51,563 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-12-06 07:19:51,563 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:51,563 INFO L89 Accepts]: Start accepts. Operand has 43 places, 45 transitions, 126 flow [2022-12-06 07:19:51,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:51,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:51,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 45 transitions, 126 flow [2022-12-06 07:19:51,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 45 transitions, 126 flow [2022-12-06 07:19:51,571 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:51,572 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:19:51,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 45 events. 10/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2022-12-06 07:19:51,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 45 transitions, 126 flow [2022-12-06 07:19:51,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:53,984 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:53,985 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2422 [2022-12-06 07:19:53,985 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 122 flow [2022-12-06 07:19:53,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-06 07:19:53,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:53,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:53,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:19:53,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:53,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:53,986 INFO L85 PathProgramCache]: Analyzing trace with hash 933338406, now seen corresponding path program 1 times [2022-12-06 07:19:53,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:53,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849293585] [2022-12-06 07:19:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:54,163 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-06 07:19:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:54,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849293585] [2022-12-06 07:19:54,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849293585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:54,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:54,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:54,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079932079] [2022-12-06 07:19:54,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:54,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:19:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:54,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:19:54,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:19:54,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:19:54,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:54,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:54,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:19:54,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:54,380 INFO L130 PetriNetUnfolder]: 943/1389 cut-off events. [2022-12-06 07:19:54,381 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2022-12-06 07:19:54,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 1389 events. 943/1389 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5044 event pairs, 733 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 3361. Up to 1388 conditions per place. [2022-12-06 07:19:54,389 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 42 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 07:19:54,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 214 flow [2022-12-06 07:19:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:19:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:19:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 07:19:54,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-06 07:19:54,392 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 122 flow. Second operand 4 states and 44 transitions. [2022-12-06 07:19:54,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 214 flow [2022-12-06 07:19:54,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 206 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:19:54,396 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:54,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 07:19:54,397 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 07:19:54,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:54,397 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:54,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:54,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:54,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:54,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:54,405 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:54,406 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:19:54,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2022-12-06 07:19:54,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:54,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:54,701 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:54,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-06 07:19:54,702 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-06 07:19:54,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:54,702 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:54,702 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:54,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:19:54,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1710610303, now seen corresponding path program 1 times [2022-12-06 07:19:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:54,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564547854] [2022-12-06 07:19:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:54,924 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-06 07:19:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:54,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564547854] [2022-12-06 07:19:54,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564547854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:54,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:54,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:54,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105832831] [2022-12-06 07:19:54,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:54,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:19:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:19:54,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:19:54,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:54,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-06 07:19:54,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:54,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:54,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:55,127 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 07:19:55,127 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2022-12-06 07:19:55,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1232 events. 835/1232 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 3002. Up to 1228 conditions per place. [2022-12-06 07:19:55,135 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 07:19:55,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 214 flow [2022-12-06 07:19:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:19:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:19:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 07:19:55,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-06 07:19:55,138 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 4 states and 47 transitions. [2022-12-06 07:19:55,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 214 flow [2022-12-06 07:19:55,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:19:55,141 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:55,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 07:19:55,143 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 07:19:55,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:55,143 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:55,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:55,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:55,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:55,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:55,153 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:55,153 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:19:55,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2022-12-06 07:19:55,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:55,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:55,447 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:55,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-06 07:19:55,448 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-06 07:19:55,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-06 07:19:55,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:55,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:55,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:19:55,450 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash -174693395, now seen corresponding path program 1 times [2022-12-06 07:19:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:55,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479820090] [2022-12-06 07:19:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:55,599 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-06 07:19:55,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:55,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479820090] [2022-12-06 07:19:55,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479820090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:55,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:55,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:55,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378397768] [2022-12-06 07:19:55,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:55,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:19:55,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:55,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:19:55,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:19:55,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:55,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-06 07:19:55,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:55,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:55,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:55,821 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 07:19:55,821 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-06 07:19:55,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1232 events. 835/1232 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 2998. Up to 1228 conditions per place. [2022-12-06 07:19:55,829 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 07:19:55,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 214 flow [2022-12-06 07:19:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:19:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:19:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 07:19:55,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-06 07:19:55,832 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 4 states and 47 transitions. [2022-12-06 07:19:55,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 214 flow [2022-12-06 07:19:55,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:19:55,837 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:55,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 07:19:55,840 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 07:19:55,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:55,840 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:55,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:55,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:55,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:55,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:55,849 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:55,849 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:19:55,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2022-12-06 07:19:55,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:55,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:56,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:56,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 07:19:56,107 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-06 07:19:56,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-06 07:19:56,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:56,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:56,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:19:56,108 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:56,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1300023411, now seen corresponding path program 1 times [2022-12-06 07:19:56,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:56,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656990474] [2022-12-06 07:19:56,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:56,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:56,330 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-06 07:19:56,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:56,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656990474] [2022-12-06 07:19:56,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656990474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:56,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:56,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:19:56,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191969199] [2022-12-06 07:19:56,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:56,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:19:56,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:56,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:19:56,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:19:56,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:19:56,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:56,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:56,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:19:56,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:56,557 INFO L130 PetriNetUnfolder]: 943/1389 cut-off events. [2022-12-06 07:19:56,557 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-06 07:19:56,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 1389 events. 943/1389 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5044 event pairs, 733 based on Foata normal form. 0/1282 useless extension candidates. Maximal degree in co-relation 3349. Up to 1386 conditions per place. [2022-12-06 07:19:56,564 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 40 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2022-12-06 07:19:56,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 216 flow [2022-12-06 07:19:56,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:19:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:19:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 07:19:56,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20952380952380953 [2022-12-06 07:19:56,565 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 5 states and 44 transitions. [2022-12-06 07:19:56,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 216 flow [2022-12-06 07:19:56,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 206 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:19:56,569 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 132 flow [2022-12-06 07:19:56,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-06 07:19:56,570 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2022-12-06 07:19:56,570 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:56,570 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 132 flow [2022-12-06 07:19:56,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:56,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:56,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 45 transitions, 132 flow [2022-12-06 07:19:56,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 45 transitions, 132 flow [2022-12-06 07:19:56,579 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:56,579 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:19:56,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2022-12-06 07:19:56,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 45 transitions, 132 flow [2022-12-06 07:19:56,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:56,804 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:56,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 07:19:56,805 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 128 flow [2022-12-06 07:19:56,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:56,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:56,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:56,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:19:56,805 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:56,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1330035469, now seen corresponding path program 1 times [2022-12-06 07:19:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:56,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568776617] [2022-12-06 07:19:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:56,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:56,977 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-06 07:19:56,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:56,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568776617] [2022-12-06 07:19:56,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568776617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:56,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:56,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:56,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281032514] [2022-12-06 07:19:56,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:56,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:19:56,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:56,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:19:56,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:19:56,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:56,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-06 07:19:56,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:56,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:56,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:57,195 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 07:19:57,195 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-06 07:19:57,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1232 events. 835/1232 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1128 useless extension candidates. Maximal degree in co-relation 2990. Up to 1228 conditions per place. [2022-12-06 07:19:57,201 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 07:19:57,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 218 flow [2022-12-06 07:19:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:19:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:19:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 07:19:57,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-06 07:19:57,202 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 128 flow. Second operand 4 states and 47 transitions. [2022-12-06 07:19:57,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 218 flow [2022-12-06 07:19:57,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 07:19:57,205 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:57,205 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 07:19:57,206 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 07:19:57,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:57,207 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:57,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:57,207 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:57,207 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:57,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:57,214 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:57,214 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:19:57,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 50. Up to 4 conditions per place. [2022-12-06 07:19:57,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:57,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:57,451 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:19:57,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-06 07:19:57,452 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 124 flow [2022-12-06 07:19:57,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-06 07:19:57,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:57,452 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:57,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:19:57,453 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:57,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1717374927, now seen corresponding path program 1 times [2022-12-06 07:19:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:57,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262511749] [2022-12-06 07:19:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:57,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:58,380 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-06 07:19:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:58,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262511749] [2022-12-06 07:19:58,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262511749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:58,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:58,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 07:19:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878403544] [2022-12-06 07:19:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:58,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:19:58,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:58,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:19:58,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:19:58,382 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:19:58,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 124 flow. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:58,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:58,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:19:58,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:59,157 INFO L130 PetriNetUnfolder]: 1472/2269 cut-off events. [2022-12-06 07:19:59,157 INFO L131 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2022-12-06 07:19:59,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5518 conditions, 2269 events. 1472/2269 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10344 event pairs, 717 based on Foata normal form. 1/2123 useless extension candidates. Maximal degree in co-relation 5487. Up to 1333 conditions per place. [2022-12-06 07:19:59,168 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 106 selfloop transitions, 11 changer transitions 13/130 dead transitions. [2022-12-06 07:19:59,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 130 transitions, 623 flow [2022-12-06 07:19:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:19:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:19:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-12-06 07:19:59,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2976190476190476 [2022-12-06 07:19:59,169 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 124 flow. Second operand 10 states and 125 transitions. [2022-12-06 07:19:59,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 130 transitions, 623 flow [2022-12-06 07:19:59,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 130 transitions, 614 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:19:59,174 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 191 flow [2022-12-06 07:19:59,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=191, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-06 07:19:59,175 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 07:19:59,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:59,175 INFO L89 Accepts]: Start accepts. Operand has 56 places, 52 transitions, 191 flow [2022-12-06 07:19:59,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:59,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:59,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 191 flow [2022-12-06 07:19:59,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 191 flow [2022-12-06 07:19:59,189 INFO L130 PetriNetUnfolder]: 19/116 cut-off events. [2022-12-06 07:19:59,189 INFO L131 PetriNetUnfolder]: For 18/20 co-relation queries the response was YES. [2022-12-06 07:19:59,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 116 events. 19/116 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 458 event pairs, 0 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 213. Up to 15 conditions per place. [2022-12-06 07:19:59,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 191 flow [2022-12-06 07:19:59,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 07:19:59,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:19:59,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-06 07:19:59,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1309] L52-6-->L52-10: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_17|) (= (select (select |v_#memory_int_46| v_~get_2~0.base_9) (+ v_~get_2~0.offset_9 (* 4 v_~id_0~0_15))) |v_thread1Thread1of1ForFork1_#t~mem6#1_9|)) InVars {~get_2~0.offset=v_~get_2~0.offset_9, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} OutVars{~get_2~0.offset=v_~get_2~0.offset_9, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_9|, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem6#1] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-06 07:19:59,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1309] L52-6-->L52-10: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_17|) (= (select (select |v_#memory_int_46| v_~get_2~0.base_9) (+ v_~get_2~0.offset_9 (* 4 v_~id_0~0_15))) |v_thread1Thread1of1ForFork1_#t~mem6#1_9|)) InVars {~get_2~0.offset=v_~get_2~0.offset_9, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} OutVars{~get_2~0.offset=v_~get_2~0.offset_9, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_9|, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem6#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:19:59,931 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:19:59,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 757 [2022-12-06 07:19:59,932 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 209 flow [2022-12-06 07:19:59,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:59,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:59,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:59,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:19:59,933 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1440331023, now seen corresponding path program 1 times [2022-12-06 07:19:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:59,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169955309] [2022-12-06 07:19:59,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:00,616 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-06 07:20:00,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:00,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169955309] [2022-12-06 07:20:00,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169955309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:00,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:00,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:20:00,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803788188] [2022-12-06 07:20:00,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:00,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:20:00,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:00,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:20:00,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:20:00,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:20:00,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 209 flow. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:00,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:00,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:20:00,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:01,390 INFO L130 PetriNetUnfolder]: 2095/3284 cut-off events. [2022-12-06 07:20:01,390 INFO L131 PetriNetUnfolder]: For 3268/3268 co-relation queries the response was YES. [2022-12-06 07:20:01,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9582 conditions, 3284 events. 2095/3284 cut-off events. For 3268/3268 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17114 event pairs, 416 based on Foata normal form. 1/3149 useless extension candidates. Maximal degree in co-relation 9546. Up to 1226 conditions per place. [2022-12-06 07:20:01,412 INFO L137 encePairwiseOnDemand]: 36/47 looper letters, 134 selfloop transitions, 22 changer transitions 9/165 dead transitions. [2022-12-06 07:20:01,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 165 transitions, 962 flow [2022-12-06 07:20:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:20:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:20:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2022-12-06 07:20:01,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4122340425531915 [2022-12-06 07:20:01,414 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 209 flow. Second operand 8 states and 155 transitions. [2022-12-06 07:20:01,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 165 transitions, 962 flow [2022-12-06 07:20:01,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 165 transitions, 943 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 07:20:01,430 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 404 flow [2022-12-06 07:20:01,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2022-12-06 07:20:01,431 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-12-06 07:20:01,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:01,431 INFO L89 Accepts]: Start accepts. Operand has 62 places, 72 transitions, 404 flow [2022-12-06 07:20:01,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:01,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:01,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 72 transitions, 404 flow [2022-12-06 07:20:01,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 72 transitions, 404 flow [2022-12-06 07:20:01,479 INFO L130 PetriNetUnfolder]: 74/334 cut-off events. [2022-12-06 07:20:01,479 INFO L131 PetriNetUnfolder]: For 419/456 co-relation queries the response was YES. [2022-12-06 07:20:01,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 334 events. 74/334 cut-off events. For 419/456 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2165 event pairs, 2 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 843. Up to 43 conditions per place. [2022-12-06 07:20:01,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 72 transitions, 404 flow [2022-12-06 07:20:01,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 738 [2022-12-06 07:20:01,493 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:20:01,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 07:20:01,494 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 72 transitions, 404 flow [2022-12-06 07:20:01,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:01,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:01,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:01,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:20:01,495 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:01,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:01,495 INFO L85 PathProgramCache]: Analyzing trace with hash -886988291, now seen corresponding path program 1 times [2022-12-06 07:20:01,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:01,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491615199] [2022-12-06 07:20:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:02,436 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-06 07:20:02,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:02,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491615199] [2022-12-06 07:20:02,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491615199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:02,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:02,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 07:20:02,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296946736] [2022-12-06 07:20:02,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:02,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:20:02,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:02,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:20:02,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:20:02,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:20:02,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 72 transitions, 404 flow. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:02,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:02,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:20:02,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:03,386 INFO L130 PetriNetUnfolder]: 2223/3569 cut-off events. [2022-12-06 07:20:03,387 INFO L131 PetriNetUnfolder]: For 7512/7512 co-relation queries the response was YES. [2022-12-06 07:20:03,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12150 conditions, 3569 events. 2223/3569 cut-off events. For 7512/7512 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 19073 event pairs, 1135 based on Foata normal form. 2/3434 useless extension candidates. Maximal degree in co-relation 12111. Up to 2457 conditions per place. [2022-12-06 07:20:03,413 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 120 selfloop transitions, 14 changer transitions 10/144 dead transitions. [2022-12-06 07:20:03,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 1029 flow [2022-12-06 07:20:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:20:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:20:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-12-06 07:20:03,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2553191489361702 [2022-12-06 07:20:03,415 INFO L175 Difference]: Start difference. First operand has 60 places, 72 transitions, 404 flow. Second operand 9 states and 108 transitions. [2022-12-06 07:20:03,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 1029 flow [2022-12-06 07:20:03,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 144 transitions, 1009 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 07:20:03,463 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 506 flow [2022-12-06 07:20:03,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2022-12-06 07:20:03,464 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2022-12-06 07:20:03,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:03,464 INFO L89 Accepts]: Start accepts. Operand has 70 places, 78 transitions, 506 flow [2022-12-06 07:20:03,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:03,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:03,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 78 transitions, 506 flow [2022-12-06 07:20:03,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 78 transitions, 506 flow [2022-12-06 07:20:03,507 INFO L130 PetriNetUnfolder]: 82/393 cut-off events. [2022-12-06 07:20:03,507 INFO L131 PetriNetUnfolder]: For 894/945 co-relation queries the response was YES. [2022-12-06 07:20:03,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 393 events. 82/393 cut-off events. For 894/945 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2751 event pairs, 3 based on Foata normal form. 5/361 useless extension candidates. Maximal degree in co-relation 1073. Up to 50 conditions per place. [2022-12-06 07:20:03,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 78 transitions, 506 flow [2022-12-06 07:20:03,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 768 [2022-12-06 07:20:03,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-06 07:20:03,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:20:03,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-06 07:20:03,762 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 78 transitions, 519 flow [2022-12-06 07:20:03,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:03,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:03,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:03,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:20:03,762 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:03,762 INFO L85 PathProgramCache]: Analyzing trace with hash 484564831, now seen corresponding path program 2 times [2022-12-06 07:20:03,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:03,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659192935] [2022-12-06 07:20:03,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:03,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:04,599 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-06 07:20:04,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:04,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659192935] [2022-12-06 07:20:04,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659192935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:04,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:04,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 07:20:04,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953484983] [2022-12-06 07:20:04,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:04,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:20:04,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:04,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:20:04,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:20:04,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 07:20:04,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 78 transitions, 519 flow. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:04,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:04,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 07:20:04,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:05,732 INFO L130 PetriNetUnfolder]: 2556/4227 cut-off events. [2022-12-06 07:20:05,733 INFO L131 PetriNetUnfolder]: For 13273/13273 co-relation queries the response was YES. [2022-12-06 07:20:05,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15317 conditions, 4227 events. 2556/4227 cut-off events. For 13273/13273 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 24362 event pairs, 1354 based on Foata normal form. 2/4062 useless extension candidates. Maximal degree in co-relation 15273. Up to 3085 conditions per place. [2022-12-06 07:20:05,759 INFO L137 encePairwiseOnDemand]: 37/48 looper letters, 114 selfloop transitions, 30 changer transitions 22/166 dead transitions. [2022-12-06 07:20:05,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 166 transitions, 1329 flow [2022-12-06 07:20:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:20:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:20:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2022-12-06 07:20:05,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23484848484848486 [2022-12-06 07:20:05,761 INFO L175 Difference]: Start difference. First operand has 69 places, 78 transitions, 519 flow. Second operand 11 states and 124 transitions. [2022-12-06 07:20:05,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 166 transitions, 1329 flow [2022-12-06 07:20:05,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 166 transitions, 1292 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-06 07:20:05,809 INFO L231 Difference]: Finished difference. Result has 82 places, 94 transitions, 769 flow [2022-12-06 07:20:05,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=769, PETRI_PLACES=82, PETRI_TRANSITIONS=94} [2022-12-06 07:20:05,810 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2022-12-06 07:20:05,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:05,810 INFO L89 Accepts]: Start accepts. Operand has 82 places, 94 transitions, 769 flow [2022-12-06 07:20:05,811 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:05,811 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:05,811 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 94 transitions, 769 flow [2022-12-06 07:20:05,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 94 transitions, 769 flow [2022-12-06 07:20:05,878 INFO L130 PetriNetUnfolder]: 114/569 cut-off events. [2022-12-06 07:20:05,879 INFO L131 PetriNetUnfolder]: For 2339/2455 co-relation queries the response was YES. [2022-12-06 07:20:05,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 569 events. 114/569 cut-off events. For 2339/2455 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4524 event pairs, 4 based on Foata normal form. 11/525 useless extension candidates. Maximal degree in co-relation 1815. Up to 79 conditions per place. [2022-12-06 07:20:05,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 94 transitions, 769 flow [2022-12-06 07:20:05,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 862 [2022-12-06 07:20:06,051 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:20:06,141 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:20:06,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 332 [2022-12-06 07:20:06,142 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 777 flow [2022-12-06 07:20:06,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:06,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:06,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:06,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:20:06,142 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:06,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1839595051, now seen corresponding path program 1 times [2022-12-06 07:20:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:06,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229886767] [2022-12-06 07:20:06,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:06,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:07,410 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-06 07:20:07,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:07,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229886767] [2022-12-06 07:20:07,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229886767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:07,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:07,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 07:20:07,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399513922] [2022-12-06 07:20:07,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:07,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:20:07,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:07,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:20:07,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:20:07,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:20:07,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 777 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:07,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:07,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:20:07,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:08,500 INFO L130 PetriNetUnfolder]: 2666/4433 cut-off events. [2022-12-06 07:20:08,500 INFO L131 PetriNetUnfolder]: For 20675/20675 co-relation queries the response was YES. [2022-12-06 07:20:08,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17395 conditions, 4433 events. 2666/4433 cut-off events. For 20675/20675 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26017 event pairs, 1800 based on Foata normal form. 1/4267 useless extension candidates. Maximal degree in co-relation 17345. Up to 4159 conditions per place. [2022-12-06 07:20:08,526 INFO L137 encePairwiseOnDemand]: 43/51 looper letters, 125 selfloop transitions, 5 changer transitions 13/143 dead transitions. [2022-12-06 07:20:08,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 143 transitions, 1336 flow [2022-12-06 07:20:08,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:20:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:20:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-06 07:20:08,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23529411764705882 [2022-12-06 07:20:08,527 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 777 flow. Second operand 8 states and 96 transitions. [2022-12-06 07:20:08,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 143 transitions, 1336 flow [2022-12-06 07:20:08,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 143 transitions, 1297 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-06 07:20:08,596 INFO L231 Difference]: Finished difference. Result has 83 places, 94 transitions, 785 flow [2022-12-06 07:20:08,597 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=785, PETRI_PLACES=83, PETRI_TRANSITIONS=94} [2022-12-06 07:20:08,597 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2022-12-06 07:20:08,597 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:08,597 INFO L89 Accepts]: Start accepts. Operand has 83 places, 94 transitions, 785 flow [2022-12-06 07:20:08,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:08,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:08,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 94 transitions, 785 flow [2022-12-06 07:20:08,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 94 transitions, 785 flow [2022-12-06 07:20:08,664 INFO L130 PetriNetUnfolder]: 114/585 cut-off events. [2022-12-06 07:20:08,664 INFO L131 PetriNetUnfolder]: For 2508/2626 co-relation queries the response was YES. [2022-12-06 07:20:08,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 585 events. 114/585 cut-off events. For 2508/2626 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4721 event pairs, 10 based on Foata normal form. 13/541 useless extension candidates. Maximal degree in co-relation 1813. Up to 85 conditions per place. [2022-12-06 07:20:08,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 94 transitions, 785 flow [2022-12-06 07:20:08,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 880 [2022-12-06 07:20:08,680 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:20:08,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 07:20:08,681 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 94 transitions, 785 flow [2022-12-06 07:20:08,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:08,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:08,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:08,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:20:08,682 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash -785898795, now seen corresponding path program 2 times [2022-12-06 07:20:08,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:08,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045228839] [2022-12-06 07:20:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:08,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:09,691 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-06 07:20:09,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:09,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045228839] [2022-12-06 07:20:09,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045228839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:09,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:09,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 07:20:09,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967847176] [2022-12-06 07:20:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:09,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:20:09,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:09,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:20:09,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:20:09,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:20:09,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 94 transitions, 785 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:09,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:09,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:20:09,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:10,754 INFO L130 PetriNetUnfolder]: 2658/4443 cut-off events. [2022-12-06 07:20:10,754 INFO L131 PetriNetUnfolder]: For 20352/20352 co-relation queries the response was YES. [2022-12-06 07:20:10,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17296 conditions, 4443 events. 2658/4443 cut-off events. For 20352/20352 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26247 event pairs, 1838 based on Foata normal form. 2/4278 useless extension candidates. Maximal degree in co-relation 17245. Up to 4159 conditions per place. [2022-12-06 07:20:10,785 INFO L137 encePairwiseOnDemand]: 42/51 looper letters, 120 selfloop transitions, 9 changer transitions 8/137 dead transitions. [2022-12-06 07:20:10,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 137 transitions, 1265 flow [2022-12-06 07:20:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:20:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:20:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-12-06 07:20:10,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22794117647058823 [2022-12-06 07:20:10,786 INFO L175 Difference]: Start difference. First operand has 81 places, 94 transitions, 785 flow. Second operand 8 states and 93 transitions. [2022-12-06 07:20:10,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 137 transitions, 1265 flow [2022-12-06 07:20:10,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 137 transitions, 1245 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 07:20:10,860 INFO L231 Difference]: Finished difference. Result has 87 places, 99 transitions, 878 flow [2022-12-06 07:20:10,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=878, PETRI_PLACES=87, PETRI_TRANSITIONS=99} [2022-12-06 07:20:10,860 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2022-12-06 07:20:10,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:10,861 INFO L89 Accepts]: Start accepts. Operand has 87 places, 99 transitions, 878 flow [2022-12-06 07:20:10,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:10,862 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:10,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 99 transitions, 878 flow [2022-12-06 07:20:10,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 99 transitions, 878 flow [2022-12-06 07:20:10,934 INFO L130 PetriNetUnfolder]: 113/595 cut-off events. [2022-12-06 07:20:10,934 INFO L131 PetriNetUnfolder]: For 2872/2990 co-relation queries the response was YES. [2022-12-06 07:20:10,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 595 events. 113/595 cut-off events. For 2872/2990 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4868 event pairs, 10 based on Foata normal form. 13/550 useless extension candidates. Maximal degree in co-relation 1898. Up to 85 conditions per place. [2022-12-06 07:20:10,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 99 transitions, 878 flow [2022-12-06 07:20:10,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-06 07:20:10,942 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:20:11,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:20:11,155 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:20:11,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-06 07:20:11,156 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 98 transitions, 887 flow [2022-12-06 07:20:11,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:11,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:11,156 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:11,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:20:11,156 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1369209799, now seen corresponding path program 1 times [2022-12-06 07:20:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:11,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649460512] [2022-12-06 07:20:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:11,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:12,130 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-06 07:20:12,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:12,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649460512] [2022-12-06 07:20:12,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649460512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:12,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:12,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 07:20:12,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144158561] [2022-12-06 07:20:12,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:12,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:20:12,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:12,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:20:12,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:20:12,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:20:12,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 98 transitions, 887 flow. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:12,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:12,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:20:12,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:13,416 INFO L130 PetriNetUnfolder]: 2693/4500 cut-off events. [2022-12-06 07:20:13,417 INFO L131 PetriNetUnfolder]: For 22796/22796 co-relation queries the response was YES. [2022-12-06 07:20:13,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17844 conditions, 4500 events. 2693/4500 cut-off events. For 22796/22796 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26736 event pairs, 1792 based on Foata normal form. 1/4334 useless extension candidates. Maximal degree in co-relation 17791. Up to 4159 conditions per place. [2022-12-06 07:20:13,441 INFO L137 encePairwiseOnDemand]: 42/53 looper letters, 127 selfloop transitions, 11 changer transitions 12/150 dead transitions. [2022-12-06 07:20:13,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 150 transitions, 1412 flow [2022-12-06 07:20:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:20:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:20:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-12-06 07:20:13,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2180293501048218 [2022-12-06 07:20:13,443 INFO L175 Difference]: Start difference. First operand has 85 places, 98 transitions, 887 flow. Second operand 9 states and 104 transitions. [2022-12-06 07:20:13,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 150 transitions, 1412 flow [2022-12-06 07:20:13,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 150 transitions, 1372 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-06 07:20:13,537 INFO L231 Difference]: Finished difference. Result has 93 places, 103 transitions, 926 flow [2022-12-06 07:20:13,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=926, PETRI_PLACES=93, PETRI_TRANSITIONS=103} [2022-12-06 07:20:13,538 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2022-12-06 07:20:13,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:13,538 INFO L89 Accepts]: Start accepts. Operand has 93 places, 103 transitions, 926 flow [2022-12-06 07:20:13,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:13,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:13,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 103 transitions, 926 flow [2022-12-06 07:20:13,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 103 transitions, 926 flow [2022-12-06 07:20:13,606 INFO L130 PetriNetUnfolder]: 114/593 cut-off events. [2022-12-06 07:20:13,606 INFO L131 PetriNetUnfolder]: For 3018/3149 co-relation queries the response was YES. [2022-12-06 07:20:13,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1992 conditions, 593 events. 114/593 cut-off events. For 3018/3149 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4814 event pairs, 9 based on Foata normal form. 13/549 useless extension candidates. Maximal degree in co-relation 1948. Up to 85 conditions per place. [2022-12-06 07:20:13,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 103 transitions, 926 flow [2022-12-06 07:20:13,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 930 [2022-12-06 07:20:13,846 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 07:20:13,865 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1866] L60-6-->L103-3: Formula: (and (<= v_~result_12~0_135 2147483647) (= (store |v_#memory_int_920| |v_ULTIMATE.start_main_~#t3~0#1.base_309| (store (select |v_#memory_int_920| |v_ULTIMATE.start_main_~#t3~0#1.base_309|) |v_ULTIMATE.start_main_~#t3~0#1.offset_272| |v_ULTIMATE.start_main_#t~pre50#1_266|)) |v_#memory_int_919|) (<= 0 (+ v_~result_12~0_135 2147483648)) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_65| |v_thread2Thread1of1ForFork2_minus_~b#1_75|) |v_thread2Thread1of1ForFork2_minus_~a#1_75|) (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (= |v_ULTIMATE.start_main_#t~pre50#1_266| |v_#pthreadsForks_603|) (= (select (select |v_#memory_int_920| v_~get_5~0.base_207) (+ v_~get_5~0.offset_203 (* v_~id_3~0_329 4))) |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|) (= |v_thread2Thread1of1ForFork2_minus_#res#1_65| v_~result_12~0_135) (= |v_thread2Thread1of1ForFork2_minus_~b#1_75| |v_thread2Thread1of1ForFork2_minus_#in~b#1_53|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_53| (select (select |v_#memory_int_920| v_~get_8~0.base_238) (+ (* v_~id_6~0_310 4) v_~get_8~0.offset_216))) (= |v_#pthreadsForks_602| (+ |v_#pthreadsForks_603| 1)) (not |v_thread2Thread1of1ForFork2_#t~short14#1_131|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_75| |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_75| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|)) InVars {~id_6~0=v_~id_6~0_310, #pthreadsForks=|v_#pthreadsForks_603|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_272|, ~get_8~0.base=v_~get_8~0.base_238, ~get_5~0.base=v_~get_5~0.base_207, ~get_8~0.offset=v_~get_8~0.offset_216, #memory_int=|v_#memory_int_920|, ~id_3~0=v_~id_3~0_329, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_309|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_131|, ~get_5~0.offset=v_~get_5~0.offset_203} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_325|, ~id_6~0=v_~id_6~0_310, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_272|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_72|, ~get_8~0.base=v_~get_8~0.base_238, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_309|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_65|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, #pthreadsForks=|v_#pthreadsForks_602|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_266|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_75|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_51|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_53|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_105|, ~id_3~0=v_~id_3~0_329, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_75|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_246|, ~get_8~0.offset=v_~get_8~0.offset_216, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_63|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_123|, ~get_5~0.base=v_~get_5~0.base_207, #memory_int=|v_#memory_int_919|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_57|, ~result_12~0=v_~result_12~0_135, ~get_5~0.offset=v_~get_5~0.offset_203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, #memory_int, thread2Thread1of1ForFork2_#t~ite18#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1] and [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 07:20:13,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1867] L60-6-->L103-3: Formula: (and (= (+ |v_#pthreadsForks_607| 1) |v_#pthreadsForks_606|) (= |v_thread2Thread1of1ForFork2_minus_#res#1_67| v_~result_12~0_137) (= |v_thread2Thread1of1ForFork2_#res#1.base_41| 0) (= (select (select |v_#memory_int_924| v_~get_8~0.base_240) (+ (* v_~id_6~0_312 4) v_~get_8~0.offset_218)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_55|) (not |v_thread2Thread1of1ForFork2_#t~short14#1_135|) (= |v_ULTIMATE.start_main_#t~pre50#1_268| |v_#pthreadsForks_607|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_77| |v_thread2Thread1of1ForFork2_minus_#in~a#1_53|) (<= 0 (+ v_~result_12~0_137 2147483648)) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_67| |v_thread2Thread1of1ForFork2_minus_~b#1_77|) |v_thread2Thread1of1ForFork2_minus_~a#1_77|) (= (store |v_#memory_int_924| |v_ULTIMATE.start_main_~#t3~0#1.base_311| (store (select |v_#memory_int_924| |v_ULTIMATE.start_main_~#t3~0#1.base_311|) |v_ULTIMATE.start_main_~#t3~0#1.offset_274| |v_ULTIMATE.start_main_#t~pre50#1_268|)) |v_#memory_int_923|) (<= v_~result_12~0_137 2147483647) (= |v_thread2Thread1of1ForFork2_minus_~b#1_77| |v_thread2Thread1of1ForFork2_minus_#in~b#1_55|) (= (select (select |v_#memory_int_924| v_~get_5~0.base_209) (+ v_~get_5~0.offset_205 (* v_~id_3~0_331 4))) |v_thread2Thread1of1ForFork2_minus_#in~a#1_53|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_41| 0) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_77|) (<= |v_thread2Thread1of1ForFork2_minus_~a#1_77| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_77|))) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_69| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|)) InVars {~id_6~0=v_~id_6~0_312, #pthreadsForks=|v_#pthreadsForks_607|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_274|, ~get_8~0.base=v_~get_8~0.base_240, ~get_5~0.base=v_~get_5~0.base_209, ~get_8~0.offset=v_~get_8~0.offset_218, #memory_int=|v_#memory_int_924|, ~id_3~0=v_~id_3~0_331, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_311|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_135|, ~get_5~0.offset=v_~get_5~0.offset_205} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_327|, ~id_6~0=v_~id_6~0_312, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_41|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_274|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_74|, ~get_8~0.base=v_~get_8~0.base_240, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_65|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_311|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_67|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_41|, #pthreadsForks=|v_#pthreadsForks_606|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_268|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_77|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_53|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_55|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_109|, ~id_3~0=v_~id_3~0_331, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_77|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_248|, ~get_8~0.offset=v_~get_8~0.offset_218, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_65|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_125|, ~get_5~0.base=v_~get_5~0.base_209, #memory_int=|v_#memory_int_923|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_59|, ~result_12~0=v_~result_12~0_137, ~get_5~0.offset=v_~get_5~0.offset_205} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, #memory_int, thread2Thread1of1ForFork2_#t~ite18#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1] and [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 07:20:14,092 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1861] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|) (= |v_thread1Thread1of1ForFork1_#res#1.base_81| 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_231|) (<= 0 (+ v_~result_9~0_149 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_97| (select (select |v_#memory_int_860| v_~get_2~0.base_215) (+ (* v_~id_0~0_306 4) v_~get_2~0.offset_193))) (= |v_thread1Thread1of1ForFork1_minus_~b#1_121| |v_thread1Thread1of1ForFork1_minus_#in~b#1_95|) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_121| |v_thread1Thread1of1ForFork1_minus_#res#1_115|) |v_thread1Thread1of1ForFork1_minus_~a#1_121|) (= v_~result_9~0_149 |v_thread1Thread1of1ForFork1_minus_#res#1_115|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_95| (select (select |v_#memory_int_860| v_~get_5~0.base_195) (+ v_~get_5~0.offset_191 (* v_~id_3~0_311 4)))) (= (mod (select (select |v_#memory_int_860| v_~contains_key_1~0.base_185) (+ v_~id_0~0_306 v_~contains_key_1~0.offset_160)) 256) 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_121| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_121| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_121|)) 1 0)) (<= v_~result_9~0_149 2147483647) (= |v_thread1Thread1of1ForFork1_#res#1.offset_81| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_97| |v_thread1Thread1of1ForFork1_minus_~a#1_121|)) InVars {~get_2~0.offset=v_~get_2~0.offset_193, ~get_5~0.base=v_~get_5~0.base_195, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_160, ~id_3~0=v_~id_3~0_311, #memory_int=|v_#memory_int_860|, ~get_2~0.base=v_~get_2~0.base_215, ~id_0~0=v_~id_0~0_306, ~get_5~0.offset=v_~get_5~0.offset_191, ~contains_key_1~0.base=v_~contains_key_1~0.base_185} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_97|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_160|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_109|, ~result_9~0=v_~result_9~0_149, ~contains_key_1~0.base=v_~contains_key_1~0.base_185, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_107|, ~id_3~0=v_~id_3~0_311, ~get_2~0.base=v_~get_2~0.base_215, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_134|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_230|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_81|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_113|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_81|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_107|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_115|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_95|, ~get_2~0.offset=v_~get_2~0.offset_193, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_121|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, ~get_5~0.base=v_~get_5~0.base_195, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_160, #memory_int=|v_#memory_int_860|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_121|, ~id_0~0=v_~id_0~0_306, ~get_5~0.offset=v_~get_5~0.offset_191} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_231|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 07:20:14,197 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 07:20:14,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1868] L102-4-->L58: Formula: (and (= |v_ULTIMATE.start_main_#t~pre50#1_273| |v_#pthreadsForks_617|) (= (store |v_#memory_int_935| |v_ULTIMATE.start_main_~#t3~0#1.base_317| (store (select |v_#memory_int_935| |v_ULTIMATE.start_main_~#t3~0#1.base_317|) |v_ULTIMATE.start_main_~#t3~0#1.offset_279| |v_ULTIMATE.start_main_#t~pre50#1_273|)) |v_#memory_int_934|) (= (+ |v_#pthreadsForks_617| 1) |v_#pthreadsForks_616|) (= |v_thread2Thread1of1ForFork2_#t~mem10#1_165| (select (select |v_#memory_int_934| v_~get_5~0.base_215) (+ v_~get_5~0.offset_211 (* v_~id_3~0_337 4))))) InVars {#pthreadsForks=|v_#pthreadsForks_617|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_279|, ~get_5~0.base=v_~get_5~0.base_215, ~id_3~0=v_~id_3~0_337, #memory_int=|v_#memory_int_935|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_317|, ~get_5~0.offset=v_~get_5~0.offset_211} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_332|, #pthreadsForks=|v_#pthreadsForks_616|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_279|, ~get_5~0.base=v_~get_5~0.base_215, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_273|, ~id_3~0=v_~id_3~0_337, #memory_int=|v_#memory_int_934|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_253|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_165|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_317|, ~get_5~0.offset=v_~get_5~0.offset_211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 07:20:14,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1868] L102-4-->L58: Formula: (and (= |v_ULTIMATE.start_main_#t~pre50#1_273| |v_#pthreadsForks_617|) (= (store |v_#memory_int_935| |v_ULTIMATE.start_main_~#t3~0#1.base_317| (store (select |v_#memory_int_935| |v_ULTIMATE.start_main_~#t3~0#1.base_317|) |v_ULTIMATE.start_main_~#t3~0#1.offset_279| |v_ULTIMATE.start_main_#t~pre50#1_273|)) |v_#memory_int_934|) (= (+ |v_#pthreadsForks_617| 1) |v_#pthreadsForks_616|) (= |v_thread2Thread1of1ForFork2_#t~mem10#1_165| (select (select |v_#memory_int_934| v_~get_5~0.base_215) (+ v_~get_5~0.offset_211 (* v_~id_3~0_337 4))))) InVars {#pthreadsForks=|v_#pthreadsForks_617|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_279|, ~get_5~0.base=v_~get_5~0.base_215, ~id_3~0=v_~id_3~0_337, #memory_int=|v_#memory_int_935|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_317|, ~get_5~0.offset=v_~get_5~0.offset_211} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_332|, #pthreadsForks=|v_#pthreadsForks_616|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_279|, ~get_5~0.base=v_~get_5~0.base_215, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_273|, ~id_3~0=v_~id_3~0_337, #memory_int=|v_#memory_int_934|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_253|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_165|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_317|, ~get_5~0.offset=v_~get_5~0.offset_211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_#t~mem10#1] [2022-12-06 07:20:14,814 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:20:14,815 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 07:20:14,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:20:14,816 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:20:14,818 INFO L158 Benchmark]: Toolchain (without parser) took 44731.89ms. Allocated memory was 179.3MB in the beginning and 766.5MB in the end (delta: 587.2MB). Free memory was 155.9MB in the beginning and 385.3MB in the end (delta: -229.5MB). Peak memory consumption was 358.7MB. Max. memory is 8.0GB. [2022-12-06 07:20:14,818 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:20:14,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.77ms. Allocated memory is still 179.3MB. Free memory was 155.9MB in the beginning and 142.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:20:14,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.15ms. Allocated memory is still 179.3MB. Free memory was 142.8MB in the beginning and 139.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 07:20:14,819 INFO L158 Benchmark]: Boogie Preprocessor took 53.76ms. Allocated memory is still 179.3MB. Free memory was 139.7MB in the beginning and 137.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 07:20:14,819 INFO L158 Benchmark]: RCFGBuilder took 773.42ms. Allocated memory is still 179.3MB. Free memory was 137.0MB in the beginning and 104.5MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 07:20:14,819 INFO L158 Benchmark]: TraceAbstraction took 43598.83ms. Allocated memory was 179.3MB in the beginning and 766.5MB in the end (delta: 587.2MB). Free memory was 103.9MB in the beginning and 385.3MB in the end (delta: -281.4MB). Peak memory consumption was 307.3MB. Max. memory is 8.0GB. [2022-12-06 07:20:14,820 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 179.3MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.77ms. Allocated memory is still 179.3MB. Free memory was 155.9MB in the beginning and 142.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.15ms. Allocated memory is still 179.3MB. Free memory was 142.8MB in the beginning and 139.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.76ms. Allocated memory is still 179.3MB. Free memory was 139.7MB in the beginning and 137.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 773.42ms. Allocated memory is still 179.3MB. Free memory was 137.0MB in the beginning and 104.5MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 43598.83ms. Allocated memory was 179.3MB in the beginning and 766.5MB in the end (delta: 587.2MB). Free memory was 103.9MB in the beginning and 385.3MB in the end (delta: -281.4MB). Peak memory consumption was 307.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.1s, 439 PlacesBefore, 42 PlacesAfterwards, 470 TransitionsBefore, 42 TransitionsAfterwards, 17280 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 266 TrivialYvCompositions, 131 ConcurrentYvCompositions, 31 ChoiceCompositions, 429 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 11492, independent unconditional: 0, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 0, independent unconditional: 11492, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 0, independent unconditional: 11492, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 0, independent unconditional: 11492, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10220, independent: 10175, independent conditional: 0, independent unconditional: 10175, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10220, independent: 10175, independent conditional: 0, independent unconditional: 10175, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11567, independent: 1317, independent conditional: 0, independent unconditional: 1317, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 10220, unknown conditional: 0, unknown unconditional: 10220] , Statistics on independence cache: Total cache size (in pairs): 20762, Positive cache size: 20717, Positive conditional cache size: 0, Positive unconditional cache size: 20717, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, 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, 43 TransitionsBefore, 43 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 154, independent: 130, independent conditional: 15, independent unconditional: 115, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 105, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 105, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 105, unknown conditional: 0, unknown unconditional: 105] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 156, independent conditional: 156, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 182, independent: 156, independent conditional: 30, independent unconditional: 126, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 182, independent: 153, independent conditional: 0, independent unconditional: 153, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 43 PlacesBefore, 42 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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, 44 PlacesBefore, 43 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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, 44 PlacesBefore, 43 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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, 44 PlacesBefore, 43 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 44 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 44 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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: 360, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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, 54 PlacesBefore, 53 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 531, independent: 494, independent conditional: 494, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 531, independent: 494, independent conditional: 145, independent unconditional: 349, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 531, independent: 494, independent conditional: 145, independent unconditional: 349, dependent: 37, dependent conditional: 24, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 531, independent: 494, independent conditional: 145, independent unconditional: 349, dependent: 37, dependent conditional: 24, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 95, independent: 81, independent conditional: 30, independent unconditional: 51, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 95, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 531, independent: 413, independent conditional: 115, independent unconditional: 298, dependent: 23, dependent conditional: 10, dependent unconditional: 13, unknown: 95, unknown conditional: 44, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 175, Positive conditional cache size: 30, Positive unconditional cache size: 145, Negative cache size: 32, Negative conditional cache size: 14, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, independent: 158, independent conditional: 158, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 178, independent: 158, independent conditional: 28, independent unconditional: 130, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, independent: 158, independent conditional: 28, independent unconditional: 130, dependent: 25, dependent conditional: 13, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, independent: 158, independent conditional: 28, independent unconditional: 130, dependent: 25, dependent conditional: 13, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 183, independent: 142, independent conditional: 28, independent unconditional: 114, dependent: 22, dependent conditional: 10, dependent unconditional: 12, unknown: 19, unknown conditional: 3, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 191, Positive conditional cache size: 30, Positive unconditional cache size: 161, Negative cache size: 35, Negative conditional cache size: 17, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 69 PlacesBefore, 69 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 768 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 375, independent: 329, independent conditional: 329, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 375, independent: 329, independent conditional: 141, independent unconditional: 188, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 375, independent: 329, independent conditional: 141, independent unconditional: 188, dependent: 46, dependent conditional: 26, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375, independent: 329, independent conditional: 141, independent unconditional: 188, dependent: 46, dependent conditional: 26, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 375, independent: 319, independent conditional: 133, independent unconditional: 186, dependent: 37, dependent conditional: 17, dependent unconditional: 20, unknown: 19, unknown conditional: 17, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 201, Positive conditional cache size: 38, Positive unconditional cache size: 163, Negative cache size: 44, Negative conditional cache size: 26, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 79 PlacesBefore, 78 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 862 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 639, independent: 583, independent conditional: 583, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 639, independent: 583, independent conditional: 315, independent unconditional: 268, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 673, independent: 583, independent conditional: 315, independent unconditional: 268, dependent: 90, dependent conditional: 64, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 673, independent: 583, independent conditional: 315, independent unconditional: 268, dependent: 90, dependent conditional: 64, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 673, independent: 574, independent conditional: 306, independent unconditional: 268, dependent: 79, dependent conditional: 53, dependent unconditional: 26, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 214, Positive conditional cache size: 47, Positive unconditional cache size: 167, Negative cache size: 55, Negative conditional cache size: 37, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 880 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 234, independent conditional: 234, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 234, independent conditional: 125, independent unconditional: 109, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 282, independent: 234, independent conditional: 113, independent unconditional: 121, dependent: 48, dependent conditional: 35, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282, independent: 234, independent conditional: 113, independent unconditional: 121, dependent: 48, dependent conditional: 35, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 282, independent: 233, independent conditional: 112, independent unconditional: 121, dependent: 46, dependent conditional: 33, dependent unconditional: 13, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 215, Positive conditional cache size: 48, Positive unconditional cache size: 167, Negative cache size: 57, Negative conditional cache size: 39, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 86 PlacesBefore, 85 PlacesAfterwards, 99 TransitionsBefore, 98 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 500, independent: 444, independent conditional: 444, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 500, independent: 444, independent conditional: 224, independent unconditional: 220, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 540, independent: 444, independent conditional: 200, independent unconditional: 244, dependent: 96, dependent conditional: 70, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 540, independent: 444, independent conditional: 200, independent unconditional: 244, dependent: 96, dependent conditional: 70, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 540, independent: 438, independent conditional: 195, independent unconditional: 243, dependent: 95, dependent conditional: 69, dependent unconditional: 26, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 221, Positive conditional cache size: 53, Positive unconditional cache size: 168, Negative cache size: 58, Negative conditional cache size: 40, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 92 PlacesBefore, 89 PlacesAfterwards, 103 TransitionsBefore, 100 TransitionsAfterwards, 930 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 373, independent: 327, independent conditional: 327, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 373, independent: 327, independent conditional: 171, independent unconditional: 156, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 388, independent: 327, independent conditional: 171, independent unconditional: 156, dependent: 61, dependent conditional: 35, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 388, independent: 327, independent conditional: 171, independent unconditional: 156, dependent: 61, dependent conditional: 35, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 388, independent: 313, independent conditional: 157, independent unconditional: 156, dependent: 59, dependent conditional: 33, dependent unconditional: 26, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 254, Positive conditional cache size: 73, Positive unconditional cache size: 181, Negative cache size: 60, Negative conditional cache size: 42, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 2 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:20:14,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...