/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/clever.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:14:33,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:14:33,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:14:33,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:14:33,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:14:33,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:14:33,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:14:33,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:14:33,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:14:33,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:14:33,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:14:33,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:14:33,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:14:33,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:14:33,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:14:33,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:14:33,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:14:33,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:14:33,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:14:33,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:14:33,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:14:33,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:14:33,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:14:33,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:14:33,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:14:33,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:14:33,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:14:33,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:14:33,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:14:33,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:14:33,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:14:33,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:14:33,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:14:33,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:14:33,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:14:33,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:14:33,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:14:33,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:14:33,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:14:33,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:14:33,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:14:33,377 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:14:33,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:14:33,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:14:33,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:14:33,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:14:33,405 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:14:33,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:14:33,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:14:33,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:14:33,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:14:33,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:14:33,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:14:33,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:14:33,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:14:33,406 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:14:33,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:14:33,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:14:33,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:14:33,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:14:33,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:14:33,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:14:33,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:14:33,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:14:33,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:14:33,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:14:33,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:14:33,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:14:33,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:14:33,407 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:14:33,407 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 05:14:33,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:14:33,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:14:33,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:14:33,692 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:14:33,693 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:14:33,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2022-12-06 05:14:34,603 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:14:34,770 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:14:34,783 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2022-12-06 05:14:34,789 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a761b15d4/dd2aabba942841e0891564f830748bed/FLAG7e9f48b0c [2022-12-06 05:14:34,806 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a761b15d4/dd2aabba942841e0891564f830748bed [2022-12-06 05:14:34,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:14:34,812 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:14:34,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:14:34,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:14:34,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:14:34,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:34" (1/1) ... [2022-12-06 05:14:34,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2394ad69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:34, skipping insertion in model container [2022-12-06 05:14:34,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:34" (1/1) ... [2022-12-06 05:14:34,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:14:34,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:14:34,995 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/clever.wvr.c[2133,2146] [2022-12-06 05:14:34,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:14:35,005 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:14:35,033 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/clever.wvr.c[2133,2146] [2022-12-06 05:14:35,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:14:35,045 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:14:35,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35 WrapperNode [2022-12-06 05:14:35,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:14:35,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:14:35,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:14:35,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:14:35,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (1/1) ... [2022-12-06 05:14:35,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (1/1) ... [2022-12-06 05:14:35,086 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2022-12-06 05:14:35,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:14:35,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:14:35,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:14:35,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:14:35,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (1/1) ... [2022-12-06 05:14:35,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (1/1) ... [2022-12-06 05:14:35,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (1/1) ... [2022-12-06 05:14:35,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (1/1) ... [2022-12-06 05:14:35,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (1/1) ... [2022-12-06 05:14:35,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (1/1) ... [2022-12-06 05:14:35,117 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (1/1) ... [2022-12-06 05:14:35,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (1/1) ... [2022-12-06 05:14:35,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:14:35,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:14:35,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:14:35,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:14:35,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (1/1) ... [2022-12-06 05:14:35,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:14:35,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:14:35,145 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 05:14:35,176 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 05:14:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:14:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:14:35,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:14:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:14:35,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:14:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:14:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:14:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:14:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:14:35,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:14:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:14:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:14:35,199 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 05:14:35,265 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:14:35,266 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:14:35,425 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:14:35,430 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:14:35,430 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:14:35,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:35 BoogieIcfgContainer [2022-12-06 05:14:35,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:14:35,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:14:35,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:14:35,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:14:35,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:14:34" (1/3) ... [2022-12-06 05:14:35,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb2ea8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:35, skipping insertion in model container [2022-12-06 05:14:35,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:35" (2/3) ... [2022-12-06 05:14:35,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb2ea8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:35, skipping insertion in model container [2022-12-06 05:14:35,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:35" (3/3) ... [2022-12-06 05:14:35,447 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2022-12-06 05:14:35,471 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:14:35,472 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:14:35,472 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:14:35,553 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:14:35,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 112 transitions, 240 flow [2022-12-06 05:14:35,650 INFO L130 PetriNetUnfolder]: 9/110 cut-off events. [2022-12-06 05:14:35,651 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:14:35,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 110 events. 9/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-12-06 05:14:35,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 112 transitions, 240 flow [2022-12-06 05:14:35,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 102 transitions, 216 flow [2022-12-06 05:14:35,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:35,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 102 transitions, 216 flow [2022-12-06 05:14:35,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 102 transitions, 216 flow [2022-12-06 05:14:35,729 INFO L130 PetriNetUnfolder]: 9/102 cut-off events. [2022-12-06 05:14:35,730 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:14:35,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 102 events. 9/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-12-06 05:14:35,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 102 transitions, 216 flow [2022-12-06 05:14:35,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-06 05:14:39,182 INFO L203 LiptonReduction]: Total number of compositions: 87 [2022-12-06 05:14:39,193 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:14:39,197 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;@666e6a87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:14:39,197 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:14:39,199 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 05:14:39,199 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:14:39,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:39,200 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:39,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:14:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1941019273, now seen corresponding path program 1 times [2022-12-06 05:14:39,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:39,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525402455] [2022-12-06 05:14:39,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:39,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:39,605 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 05:14:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:39,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525402455] [2022-12-06 05:14:39,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525402455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:39,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:39,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:14:39,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685089297] [2022-12-06 05:14:39,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:39,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:14:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:39,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:14:39,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:14:39,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:14:39,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 42 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 05:14:39,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:39,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:14:39,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:39,682 INFO L130 PetriNetUnfolder]: 69/117 cut-off events. [2022-12-06 05:14:39,683 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 05:14:39,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 117 events. 69/117 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 282 event pairs, 15 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 204. Up to 73 conditions per place. [2022-12-06 05:14:39,684 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 05:14:39,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 129 flow [2022-12-06 05:14:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:14:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:14:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-06 05:14:39,692 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2022-12-06 05:14:39,693 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 42 flow. Second operand 3 states and 28 transitions. [2022-12-06 05:14:39,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 129 flow [2022-12-06 05:14:39,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 27 transitions, 115 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:14:39,696 INFO L231 Difference]: Finished difference. Result has 18 places, 17 transitions, 53 flow [2022-12-06 05:14:39,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=18, PETRI_TRANSITIONS=17} [2022-12-06 05:14:39,700 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2022-12-06 05:14:39,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:39,700 INFO L89 Accepts]: Start accepts. Operand has 18 places, 17 transitions, 53 flow [2022-12-06 05:14:39,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:39,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:39,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 18 places, 17 transitions, 53 flow [2022-12-06 05:14:39,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 17 transitions, 53 flow [2022-12-06 05:14:39,733 INFO L130 PetriNetUnfolder]: 9/31 cut-off events. [2022-12-06 05:14:39,734 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:14:39,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 9/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 10 conditions per place. [2022-12-06 05:14:39,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 17 transitions, 53 flow [2022-12-06 05:14:39,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 05:14:39,735 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:39,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 05:14:39,736 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 17 transitions, 53 flow [2022-12-06 05:14:39,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 05:14:39,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:39,736 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:39,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:14:39,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:14:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:39,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1677528037, now seen corresponding path program 1 times [2022-12-06 05:14:39,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:39,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127920329] [2022-12-06 05:14:39,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:39,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127920329] [2022-12-06 05:14:39,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127920329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:39,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:39,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:14:39,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515762175] [2022-12-06 05:14:39,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:39,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:14:39,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:39,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:14:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:14:39,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:14:39,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 05:14:39,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:39,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:14:39,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:39,903 INFO L130 PetriNetUnfolder]: 125/216 cut-off events. [2022-12-06 05:14:39,903 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-06 05:14:39,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 216 events. 125/216 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 686 event pairs, 11 based on Foata normal form. 8/202 useless extension candidates. Maximal degree in co-relation 181. Up to 79 conditions per place. [2022-12-06 05:14:39,908 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 40 selfloop transitions, 7 changer transitions 2/49 dead transitions. [2022-12-06 05:14:39,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 49 transitions, 242 flow [2022-12-06 05:14:39,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 05:14:39,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-06 05:14:39,910 INFO L175 Difference]: Start difference. First operand has 18 places, 17 transitions, 53 flow. Second operand 5 states and 44 transitions. [2022-12-06 05:14:39,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 49 transitions, 242 flow [2022-12-06 05:14:39,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 49 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:14:39,912 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 101 flow [2022-12-06 05:14:39,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2022-12-06 05:14:39,913 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 5 predicate places. [2022-12-06 05:14:39,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:39,913 INFO L89 Accepts]: Start accepts. Operand has 24 places, 23 transitions, 101 flow [2022-12-06 05:14:39,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:39,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:39,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 23 transitions, 101 flow [2022-12-06 05:14:39,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 23 transitions, 101 flow [2022-12-06 05:14:39,921 INFO L130 PetriNetUnfolder]: 29/79 cut-off events. [2022-12-06 05:14:39,921 INFO L131 PetriNetUnfolder]: For 23/36 co-relation queries the response was YES. [2022-12-06 05:14:39,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 79 events. 29/79 cut-off events. For 23/36 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 250 event pairs, 1 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 136. Up to 19 conditions per place. [2022-12-06 05:14:39,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 23 transitions, 101 flow [2022-12-06 05:14:39,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-06 05:14:39,954 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L51-1-->thread2EXIT: Formula: (and (not (< v_~i2~0_In_3 v_~n~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_3, ~i2~0=v_~i2~0_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, ~i2~0=v_~i2~0_In_3, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] [2022-12-06 05:14:39,991 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:14:39,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 05:14:39,993 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 105 flow [2022-12-06 05:14:39,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 05:14:39,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:39,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:39,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:14:39,994 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:14:39,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1006824449, now seen corresponding path program 2 times [2022-12-06 05:14:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:39,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574211053] [2022-12-06 05:14:39,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:39,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:40,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:40,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574211053] [2022-12-06 05:14:40,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574211053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:40,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:40,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:14:40,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70768134] [2022-12-06 05:14:40,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:40,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:14:40,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:40,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:14:40,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:14:40,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:14:40,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 05:14:40,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:40,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:14:40,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:40,093 INFO L130 PetriNetUnfolder]: 111/192 cut-off events. [2022-12-06 05:14:40,093 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-12-06 05:14:40,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 192 events. 111/192 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 570 event pairs, 7 based on Foata normal form. 4/188 useless extension candidates. Maximal degree in co-relation 249. Up to 76 conditions per place. [2022-12-06 05:14:40,094 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 32 selfloop transitions, 10 changer transitions 6/48 dead transitions. [2022-12-06 05:14:40,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 48 transitions, 298 flow [2022-12-06 05:14:40,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 05:14:40,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 05:14:40,095 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 105 flow. Second operand 5 states and 40 transitions. [2022-12-06 05:14:40,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 48 transitions, 298 flow [2022-12-06 05:14:40,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 48 transitions, 294 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 05:14:40,097 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 154 flow [2022-12-06 05:14:40,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2022-12-06 05:14:40,098 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 11 predicate places. [2022-12-06 05:14:40,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:40,098 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 154 flow [2022-12-06 05:14:40,099 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:40,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:40,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 154 flow [2022-12-06 05:14:40,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 154 flow [2022-12-06 05:14:40,103 INFO L130 PetriNetUnfolder]: 31/74 cut-off events. [2022-12-06 05:14:40,104 INFO L131 PetriNetUnfolder]: For 69/77 co-relation queries the response was YES. [2022-12-06 05:14:40,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 74 events. 31/74 cut-off events. For 69/77 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 211 event pairs, 2 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 186. Up to 25 conditions per place. [2022-12-06 05:14:40,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 154 flow [2022-12-06 05:14:40,104 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 05:14:40,105 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:40,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 05:14:40,106 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 154 flow [2022-12-06 05:14:40,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 05:14:40,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:40,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:40,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:14:40,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:14:40,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1476743439, now seen corresponding path program 1 times [2022-12-06 05:14:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:40,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190383200] [2022-12-06 05:14:40,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:14:40,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:40,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190383200] [2022-12-06 05:14:40,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190383200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:40,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:40,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:14:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101001781] [2022-12-06 05:14:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:40,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:14:40,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:40,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:14:40,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:14:40,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:14:40,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 05:14:40,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:40,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:14:40,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:40,205 INFO L130 PetriNetUnfolder]: 116/209 cut-off events. [2022-12-06 05:14:40,208 INFO L131 PetriNetUnfolder]: For 375/375 co-relation queries the response was YES. [2022-12-06 05:14:40,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 209 events. 116/209 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 636 event pairs, 22 based on Foata normal form. 10/219 useless extension candidates. Maximal degree in co-relation 399. Up to 68 conditions per place. [2022-12-06 05:14:40,211 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 37 selfloop transitions, 6 changer transitions 6/49 dead transitions. [2022-12-06 05:14:40,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 49 transitions, 362 flow [2022-12-06 05:14:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 05:14:40,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 05:14:40,213 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 154 flow. Second operand 5 states and 40 transitions. [2022-12-06 05:14:40,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 49 transitions, 362 flow [2022-12-06 05:14:40,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 354 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-06 05:14:40,218 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 206 flow [2022-12-06 05:14:40,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-12-06 05:14:40,219 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 19 predicate places. [2022-12-06 05:14:40,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:40,219 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 206 flow [2022-12-06 05:14:40,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:40,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:40,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 206 flow [2022-12-06 05:14:40,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 206 flow [2022-12-06 05:14:40,227 INFO L130 PetriNetUnfolder]: 21/65 cut-off events. [2022-12-06 05:14:40,227 INFO L131 PetriNetUnfolder]: For 117/120 co-relation queries the response was YES. [2022-12-06 05:14:40,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 65 events. 21/65 cut-off events. For 117/120 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 1 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 178. Up to 18 conditions per place. [2022-12-06 05:14:40,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 206 flow [2022-12-06 05:14:40,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 05:14:40,230 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:40,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:14:40,237 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 206 flow [2022-12-06 05:14:40,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 05:14:40,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:40,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:40,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:14:40,237 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:14:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash -617492605, now seen corresponding path program 2 times [2022-12-06 05:14:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:40,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054581192] [2022-12-06 05:14:40,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:40,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:40,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054581192] [2022-12-06 05:14:40,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054581192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:40,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:40,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:14:40,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136049347] [2022-12-06 05:14:40,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:40,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:14:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:40,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:14:40,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:14:40,279 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:14:40,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 05:14:40,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:40,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:14:40,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:40,325 INFO L130 PetriNetUnfolder]: 88/150 cut-off events. [2022-12-06 05:14:40,326 INFO L131 PetriNetUnfolder]: For 322/322 co-relation queries the response was YES. [2022-12-06 05:14:40,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 150 events. 88/150 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 391 event pairs, 6 based on Foata normal form. 4/154 useless extension candidates. Maximal degree in co-relation 523. Up to 75 conditions per place. [2022-12-06 05:14:40,327 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 30 selfloop transitions, 5 changer transitions 5/40 dead transitions. [2022-12-06 05:14:40,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 327 flow [2022-12-06 05:14:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:14:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:14:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 05:14:40,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-06 05:14:40,327 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 206 flow. Second operand 4 states and 33 transitions. [2022-12-06 05:14:40,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 327 flow [2022-12-06 05:14:40,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 325 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 05:14:40,329 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 194 flow [2022-12-06 05:14:40,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-06 05:14:40,330 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 22 predicate places. [2022-12-06 05:14:40,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:40,330 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 194 flow [2022-12-06 05:14:40,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:40,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:40,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 194 flow [2022-12-06 05:14:40,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 194 flow [2022-12-06 05:14:40,334 INFO L130 PetriNetUnfolder]: 21/48 cut-off events. [2022-12-06 05:14:40,334 INFO L131 PetriNetUnfolder]: For 107/110 co-relation queries the response was YES. [2022-12-06 05:14:40,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 48 events. 21/48 cut-off events. For 107/110 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 1 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 146. Up to 17 conditions per place. [2022-12-06 05:14:40,335 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 194 flow [2022-12-06 05:14:40,335 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:14:40,335 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:40,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 05:14:40,336 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 194 flow [2022-12-06 05:14:40,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 05:14:40,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:40,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:40,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:14:40,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:14:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:40,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1669050343, now seen corresponding path program 1 times [2022-12-06 05:14:40,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:40,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329164390] [2022-12-06 05:14:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:40,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:40,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:40,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329164390] [2022-12-06 05:14:40,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329164390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:14:40,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905674478] [2022-12-06 05:14:40,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:40,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:14:40,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:14:40,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:14:40,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:14:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:40,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:14:40,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:14:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:45,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:14:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:45,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905674478] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:14:45,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:14:45,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 05:14:45,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41797081] [2022-12-06 05:14:45,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:14:45,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:14:45,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:45,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:14:45,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=109, Unknown=2, NotChecked=0, Total=156 [2022-12-06 05:14:45,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:14:45,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 194 flow. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:45,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:45,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:14:45,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:46,566 INFO L130 PetriNetUnfolder]: 382/661 cut-off events. [2022-12-06 05:14:46,567 INFO L131 PetriNetUnfolder]: For 1303/1303 co-relation queries the response was YES. [2022-12-06 05:14:46,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 661 events. 382/661 cut-off events. For 1303/1303 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2750 event pairs, 2 based on Foata normal form. 6/667 useless extension candidates. Maximal degree in co-relation 1335. Up to 222 conditions per place. [2022-12-06 05:14:46,570 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 102 selfloop transitions, 69 changer transitions 49/220 dead transitions. [2022-12-06 05:14:46,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 220 transitions, 1850 flow [2022-12-06 05:14:46,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:14:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:14:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 188 transitions. [2022-12-06 05:14:46,573 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5820433436532507 [2022-12-06 05:14:46,573 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 194 flow. Second operand 19 states and 188 transitions. [2022-12-06 05:14:46,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 220 transitions, 1850 flow [2022-12-06 05:14:46,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 220 transitions, 1787 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-06 05:14:46,579 INFO L231 Difference]: Finished difference. Result has 66 places, 109 transitions, 1156 flow [2022-12-06 05:14:46,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1156, PETRI_PLACES=66, PETRI_TRANSITIONS=109} [2022-12-06 05:14:46,582 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 47 predicate places. [2022-12-06 05:14:46,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:46,582 INFO L89 Accepts]: Start accepts. Operand has 66 places, 109 transitions, 1156 flow [2022-12-06 05:14:46,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:46,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:46,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 109 transitions, 1156 flow [2022-12-06 05:14:46,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 109 transitions, 1156 flow [2022-12-06 05:14:46,610 INFO L130 PetriNetUnfolder]: 111/253 cut-off events. [2022-12-06 05:14:46,610 INFO L131 PetriNetUnfolder]: For 922/927 co-relation queries the response was YES. [2022-12-06 05:14:46,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 253 events. 111/253 cut-off events. For 922/927 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1097 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 1104. Up to 92 conditions per place. [2022-12-06 05:14:46,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 109 transitions, 1156 flow [2022-12-06 05:14:46,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 05:14:46,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:14:46,798 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L40-1-->L41-6: Formula: (and (= (+ v_~k1~0_80 1) v_~k1~0_79) (< v_~i1~0_71 v_~n~0_55) (< v_~j1~0_71 (+ v_~m~0_65 1)) (= v_~j1~0_71 1)) InVars {~m~0=v_~m~0_65, ~k1~0=v_~k1~0_80, ~i1~0=v_~i1~0_71, ~n~0=v_~n~0_55} OutVars{~m~0=v_~m~0_65, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_20|, ~k1~0=v_~k1~0_79, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_22|, ~j1~0=v_~j1~0_71, ~i1~0=v_~i1~0_71, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:14:46,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:14:47,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [396] L51-1-->L41-6: Formula: (and (= v_~j1~0_68 0) (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (< v_~i1~0_68 v_~n~0_53) (not (< v_~i2~0_62 v_~n~0_53))) InVars {~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~j1~0=v_~j1~0_68, ~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-06 05:14:47,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [399] L40-1-->L51-1: Formula: (and (< v_~i1~0_77 v_~n~0_59) (= (+ v_~m~0_69 v_~k2~0_68) v_~k2~0_67) (= v_~j1~0_77 0) (= v_~i2~0_65 (+ v_~i2~0_66 1)) (< v_~i2~0_66 v_~n~0_59)) InVars {~m~0=v_~m~0_69, ~k2~0=v_~k2~0_68, ~i2~0=v_~i2~0_66, ~i1~0=v_~i1~0_77, ~n~0=v_~n~0_59} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_21|, ~m~0=v_~m~0_69, ~k2~0=v_~k2~0_67, ~i2~0=v_~i2~0_65, ~j1~0=v_~j1~0_77, ~i1~0=v_~i1~0_77, ~n~0=v_~n~0_59} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0, ~j1~0] and [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] [2022-12-06 05:14:47,175 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [399] L40-1-->L51-1: Formula: (and (< v_~i1~0_77 v_~n~0_59) (= (+ v_~m~0_69 v_~k2~0_68) v_~k2~0_67) (= v_~j1~0_77 0) (= v_~i2~0_65 (+ v_~i2~0_66 1)) (< v_~i2~0_66 v_~n~0_59)) InVars {~m~0=v_~m~0_69, ~k2~0=v_~k2~0_68, ~i2~0=v_~i2~0_66, ~i1~0=v_~i1~0_77, ~n~0=v_~n~0_59} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_21|, ~m~0=v_~m~0_69, ~k2~0=v_~k2~0_67, ~i2~0=v_~i2~0_65, ~j1~0=v_~j1~0_77, ~i1~0=v_~i1~0_77, ~n~0=v_~n~0_59} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0, ~j1~0] and [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-06 05:14:47,329 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:14:47,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 748 [2022-12-06 05:14:47,330 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 107 transitions, 1216 flow [2022-12-06 05:14:47,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:47,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:47,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:47,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:14:47,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 05:14:47,531 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:14:47,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1093522903, now seen corresponding path program 2 times [2022-12-06 05:14:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:47,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372807242] [2022-12-06 05:14:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:47,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:47,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372807242] [2022-12-06 05:14:47,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372807242] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:14:47,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475437345] [2022-12-06 05:14:47,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:14:47,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:14:47,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:14:47,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:14:47,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:14:47,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:14:47,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:14:47,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:14:47,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:14:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:50,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:14:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:50,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475437345] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:14:50,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:14:50,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 05:14:50,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254789797] [2022-12-06 05:14:50,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:14:50,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:14:50,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:50,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:14:50,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=106, Unknown=1, NotChecked=0, Total=156 [2022-12-06 05:14:50,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:14:50,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 107 transitions, 1216 flow. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:50,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:50,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:14:50,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:53,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-06 05:14:56,015 INFO L130 PetriNetUnfolder]: 977/1703 cut-off events. [2022-12-06 05:14:56,015 INFO L131 PetriNetUnfolder]: For 6556/6556 co-relation queries the response was YES. [2022-12-06 05:14:56,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8965 conditions, 1703 events. 977/1703 cut-off events. For 6556/6556 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9002 event pairs, 0 based on Foata normal form. 6/1709 useless extension candidates. Maximal degree in co-relation 7908. Up to 600 conditions per place. [2022-12-06 05:14:56,026 INFO L137 encePairwiseOnDemand]: 9/28 looper letters, 167 selfloop transitions, 181 changer transitions 30/378 dead transitions. [2022-12-06 05:14:56,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 378 transitions, 4575 flow [2022-12-06 05:14:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:14:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:14:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 150 transitions. [2022-12-06 05:14:56,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3826530612244898 [2022-12-06 05:14:56,030 INFO L175 Difference]: Start difference. First operand has 64 places, 107 transitions, 1216 flow. Second operand 14 states and 150 transitions. [2022-12-06 05:14:56,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 378 transitions, 4575 flow [2022-12-06 05:14:56,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 378 transitions, 4070 flow, removed 230 selfloop flow, removed 5 redundant places. [2022-12-06 05:14:56,064 INFO L231 Difference]: Finished difference. Result has 83 places, 259 transitions, 3282 flow [2022-12-06 05:14:56,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3282, PETRI_PLACES=83, PETRI_TRANSITIONS=259} [2022-12-06 05:14:56,065 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 64 predicate places. [2022-12-06 05:14:56,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:56,065 INFO L89 Accepts]: Start accepts. Operand has 83 places, 259 transitions, 3282 flow [2022-12-06 05:14:56,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:56,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:56,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 259 transitions, 3282 flow [2022-12-06 05:14:56,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 259 transitions, 3282 flow [2022-12-06 05:14:56,116 INFO L130 PetriNetUnfolder]: 297/689 cut-off events. [2022-12-06 05:14:56,116 INFO L131 PetriNetUnfolder]: For 4480/4547 co-relation queries the response was YES. [2022-12-06 05:14:56,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 689 events. 297/689 cut-off events. For 4480/4547 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4022 event pairs, 0 based on Foata normal form. 1/689 useless extension candidates. Maximal degree in co-relation 3523. Up to 262 conditions per place. [2022-12-06 05:14:56,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 259 transitions, 3282 flow [2022-12-06 05:14:56,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 658 [2022-12-06 05:14:56,192 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [400] L40-1-->L41-6: Formula: (and (< v_~i1~0_79 v_~n~0_61) (< 1 v_~m~0_71) (= v_~k1~0_83 (+ 2 v_~k1~0_85)) (= 2 v_~j1~0_79)) InVars {~m~0=v_~m~0_71, ~k1~0=v_~k1~0_85, ~i1~0=v_~i1~0_79, ~n~0=v_~n~0_61} OutVars{~m~0=v_~m~0_71, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_22|, ~k1~0=v_~k1~0_83, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_24|, ~j1~0=v_~j1~0_79, ~i1~0=v_~i1~0_79, ~n~0=v_~n~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:14:56,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] [2022-12-06 05:14:56,407 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:14:56,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 343 [2022-12-06 05:14:56,408 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 258 transitions, 3300 flow [2022-12-06 05:14:56,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:56,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:56,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:56,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:14:56,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 05:14:56,609 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:14:56,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:56,610 INFO L85 PathProgramCache]: Analyzing trace with hash 20624319, now seen corresponding path program 1 times [2022-12-06 05:14:56,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:56,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985489649] [2022-12-06 05:14:56,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:56,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:56,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985489649] [2022-12-06 05:14:56,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985489649] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:14:56,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380521869] [2022-12-06 05:14:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:56,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:14:56,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:14:56,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:14:56,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:14:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:56,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:14:56,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:14:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:57,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:14:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:14:57,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380521869] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:14:57,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:14:57,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 3] total 7 [2022-12-06 05:14:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548294105] [2022-12-06 05:14:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:57,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:14:57,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:57,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:14:57,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:14:57,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:14:57,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 258 transitions, 3300 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:57,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:57,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:14:57,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:57,801 INFO L130 PetriNetUnfolder]: 996/1731 cut-off events. [2022-12-06 05:14:57,801 INFO L131 PetriNetUnfolder]: For 10668/10668 co-relation queries the response was YES. [2022-12-06 05:14:57,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10466 conditions, 1731 events. 996/1731 cut-off events. For 10668/10668 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9225 event pairs, 33 based on Foata normal form. 1/1730 useless extension candidates. Maximal degree in co-relation 9471. Up to 1597 conditions per place. [2022-12-06 05:14:57,814 INFO L137 encePairwiseOnDemand]: 12/32 looper letters, 253 selfloop transitions, 31 changer transitions 8/292 dead transitions. [2022-12-06 05:14:57,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 292 transitions, 4292 flow [2022-12-06 05:14:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:14:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:14:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 05:14:57,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 05:14:57,816 INFO L175 Difference]: Start difference. First operand has 81 places, 258 transitions, 3300 flow. Second operand 4 states and 52 transitions. [2022-12-06 05:14:57,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 292 transitions, 4292 flow [2022-12-06 05:14:57,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 292 transitions, 4147 flow, removed 58 selfloop flow, removed 5 redundant places. [2022-12-06 05:14:57,921 INFO L231 Difference]: Finished difference. Result has 81 places, 266 transitions, 3388 flow [2022-12-06 05:14:57,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3169, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3388, PETRI_PLACES=81, PETRI_TRANSITIONS=266} [2022-12-06 05:14:57,923 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 62 predicate places. [2022-12-06 05:14:57,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:57,923 INFO L89 Accepts]: Start accepts. Operand has 81 places, 266 transitions, 3388 flow [2022-12-06 05:14:57,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:57,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:57,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 266 transitions, 3388 flow [2022-12-06 05:14:57,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 266 transitions, 3388 flow [2022-12-06 05:14:57,973 INFO L130 PetriNetUnfolder]: 314/728 cut-off events. [2022-12-06 05:14:57,973 INFO L131 PetriNetUnfolder]: For 4393/4475 co-relation queries the response was YES. [2022-12-06 05:14:57,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 728 events. 314/728 cut-off events. For 4393/4475 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4318 event pairs, 2 based on Foata normal form. 1/725 useless extension candidates. Maximal degree in co-relation 3882. Up to 259 conditions per place. [2022-12-06 05:14:57,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 266 transitions, 3388 flow [2022-12-06 05:14:57,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-06 05:14:57,983 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:57,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 05:14:57,984 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 266 transitions, 3388 flow [2022-12-06 05:14:57,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:57,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:57,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:57,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 05:14:58,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:14:58,190 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:14:58,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1330334046, now seen corresponding path program 1 times [2022-12-06 05:14:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:58,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638524338] [2022-12-06 05:14:58,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:58,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:58,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638524338] [2022-12-06 05:14:58,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638524338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:14:58,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070470326] [2022-12-06 05:14:58,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:58,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:14:58,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:14:58,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:14:58,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:14:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:58,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:14:58,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:00,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:00,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070470326] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:00,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:00,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-06 05:15:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259331692] [2022-12-06 05:15:00,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:00,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:15:00,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:00,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:15:00,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:15:00,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:15:00,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 266 transitions, 3388 flow. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:00,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:00,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:15:00,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:02,043 INFO L130 PetriNetUnfolder]: 1208/2108 cut-off events. [2022-12-06 05:15:02,043 INFO L131 PetriNetUnfolder]: For 12140/12140 co-relation queries the response was YES. [2022-12-06 05:15:02,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12641 conditions, 2108 events. 1208/2108 cut-off events. For 12140/12140 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11841 event pairs, 4 based on Foata normal form. 6/2106 useless extension candidates. Maximal degree in co-relation 12535. Up to 1663 conditions per place. [2022-12-06 05:15:02,063 INFO L137 encePairwiseOnDemand]: 9/32 looper letters, 295 selfloop transitions, 94 changer transitions 50/439 dead transitions. [2022-12-06 05:15:02,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 439 transitions, 5931 flow [2022-12-06 05:15:02,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 05:15:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 05:15:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 192 transitions. [2022-12-06 05:15:02,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 05:15:02,065 INFO L175 Difference]: Start difference. First operand has 80 places, 266 transitions, 3388 flow. Second operand 20 states and 192 transitions. [2022-12-06 05:15:02,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 439 transitions, 5931 flow [2022-12-06 05:15:02,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 439 transitions, 5895 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-06 05:15:02,121 INFO L231 Difference]: Finished difference. Result has 111 places, 332 transitions, 4596 flow [2022-12-06 05:15:02,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3358, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4596, PETRI_PLACES=111, PETRI_TRANSITIONS=332} [2022-12-06 05:15:02,121 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 92 predicate places. [2022-12-06 05:15:02,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:02,121 INFO L89 Accepts]: Start accepts. Operand has 111 places, 332 transitions, 4596 flow [2022-12-06 05:15:02,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:02,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:02,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 332 transitions, 4596 flow [2022-12-06 05:15:02,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 332 transitions, 4596 flow [2022-12-06 05:15:02,203 INFO L130 PetriNetUnfolder]: 378/886 cut-off events. [2022-12-06 05:15:02,203 INFO L131 PetriNetUnfolder]: For 7831/7916 co-relation queries the response was YES. [2022-12-06 05:15:02,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5206 conditions, 886 events. 378/886 cut-off events. For 7831/7916 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5686 event pairs, 0 based on Foata normal form. 2/884 useless extension candidates. Maximal degree in co-relation 5047. Up to 316 conditions per place. [2022-12-06 05:15:02,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 332 transitions, 4596 flow [2022-12-06 05:15:02,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-06 05:15:02,296 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:02,396 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L40-1-->L40-1: Formula: (and (< v_~i1~0_121 v_~n~0_89) (= v_~j1~0_118 0) (not (< v_~j1~0_118 v_~m~0_99)) (= (+ v_~i1~0_121 1) v_~i1~0_120)) InVars {~m~0=v_~m~0_99, ~i1~0=v_~i1~0_121, ~n~0=v_~n~0_89} OutVars{~m~0=v_~m~0_99, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_49|, ~j1~0=v_~j1~0_118, ~i1~0=v_~i1~0_120, ~n~0=v_~n~0_89} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:02,602 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-06 05:15:02,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] [2022-12-06 05:15:02,760 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] [2022-12-06 05:15:02,919 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] L51-1-->L40-1: Formula: (and (= (+ v_~k2~0_128 v_~m~0_115) v_~k2~0_127) (< v_~i2~0_125 v_~n~0_103) (= (+ v_~i1~0_141 1) v_~i1~0_140) (= v_~i2~0_124 (+ v_~i2~0_125 1)) (not (< v_~j1~0_144 v_~m~0_115))) InVars {~m~0=v_~m~0_115, ~k2~0=v_~k2~0_128, ~j1~0=v_~j1~0_144, ~i2~0=v_~i2~0_125, ~i1~0=v_~i1~0_141, ~n~0=v_~n~0_103} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_57|, ~m~0=v_~m~0_115, ~k2~0=v_~k2~0_127, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_57|, ~j1~0=v_~j1~0_144, ~i2~0=v_~i2~0_124, ~i1~0=v_~i1~0_140, ~n~0=v_~n~0_103} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0] and [396] L51-1-->L41-6: Formula: (and (= v_~j1~0_68 0) (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (< v_~i1~0_68 v_~n~0_53) (not (< v_~i2~0_62 v_~n~0_53))) InVars {~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~j1~0=v_~j1~0_68, ~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-06 05:15:03,048 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] L51-1-->L40-1: Formula: (and (= (+ v_~k2~0_128 v_~m~0_115) v_~k2~0_127) (< v_~i2~0_125 v_~n~0_103) (= (+ v_~i1~0_141 1) v_~i1~0_140) (= v_~i2~0_124 (+ v_~i2~0_125 1)) (not (< v_~j1~0_144 v_~m~0_115))) InVars {~m~0=v_~m~0_115, ~k2~0=v_~k2~0_128, ~j1~0=v_~j1~0_144, ~i2~0=v_~i2~0_125, ~i1~0=v_~i1~0_141, ~n~0=v_~n~0_103} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_57|, ~m~0=v_~m~0_115, ~k2~0=v_~k2~0_127, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_57|, ~j1~0=v_~j1~0_144, ~i2~0=v_~i2~0_124, ~i1~0=v_~i1~0_140, ~n~0=v_~n~0_103} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:03,121 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 05:15:03,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1000 [2022-12-06 05:15:03,121 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 331 transitions, 4763 flow [2022-12-06 05:15:03,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:03,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:03,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:03,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:15:03,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:03,327 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:15:03,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:03,327 INFO L85 PathProgramCache]: Analyzing trace with hash 655446849, now seen corresponding path program 1 times [2022-12-06 05:15:03,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:03,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654322618] [2022-12-06 05:15:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:03,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:03,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:03,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654322618] [2022-12-06 05:15:03,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654322618] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:03,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707560794] [2022-12-06 05:15:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:03,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:03,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:03,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:15:03,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:15:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:03,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:15:03,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:03,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:03,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707560794] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:03,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:03,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 05:15:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757679376] [2022-12-06 05:15:03,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:03,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:15:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:15:03,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:15:03,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:15:03,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 331 transitions, 4763 flow. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:03,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:03,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:15:03,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:04,067 INFO L130 PetriNetUnfolder]: 1514/2536 cut-off events. [2022-12-06 05:15:04,067 INFO L131 PetriNetUnfolder]: For 21534/21534 co-relation queries the response was YES. [2022-12-06 05:15:04,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16920 conditions, 2536 events. 1514/2536 cut-off events. For 21534/21534 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 14017 event pairs, 4 based on Foata normal form. 28/2548 useless extension candidates. Maximal degree in co-relation 16775. Up to 1018 conditions per place. [2022-12-06 05:15:04,120 INFO L137 encePairwiseOnDemand]: 14/48 looper letters, 338 selfloop transitions, 229 changer transitions 7/574 dead transitions. [2022-12-06 05:15:04,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 574 transitions, 8785 flow [2022-12-06 05:15:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:15:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:15:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-12-06 05:15:04,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20833333333333334 [2022-12-06 05:15:04,121 INFO L175 Difference]: Start difference. First operand has 110 places, 331 transitions, 4763 flow. Second operand 10 states and 100 transitions. [2022-12-06 05:15:04,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 574 transitions, 8785 flow [2022-12-06 05:15:04,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 574 transitions, 8208 flow, removed 272 selfloop flow, removed 5 redundant places. [2022-12-06 05:15:04,232 INFO L231 Difference]: Finished difference. Result has 119 places, 395 transitions, 6033 flow [2022-12-06 05:15:04,232 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4239, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6033, PETRI_PLACES=119, PETRI_TRANSITIONS=395} [2022-12-06 05:15:04,232 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 100 predicate places. [2022-12-06 05:15:04,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:04,233 INFO L89 Accepts]: Start accepts. Operand has 119 places, 395 transitions, 6033 flow [2022-12-06 05:15:04,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:04,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:04,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 395 transitions, 6033 flow [2022-12-06 05:15:04,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 395 transitions, 6033 flow [2022-12-06 05:15:04,341 INFO L130 PetriNetUnfolder]: 500/1062 cut-off events. [2022-12-06 05:15:04,341 INFO L131 PetriNetUnfolder]: For 12204/12957 co-relation queries the response was YES. [2022-12-06 05:15:04,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7167 conditions, 1062 events. 500/1062 cut-off events. For 12204/12957 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6520 event pairs, 0 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 6965. Up to 406 conditions per place. [2022-12-06 05:15:04,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 395 transitions, 6033 flow [2022-12-06 05:15:04,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 954 [2022-12-06 05:15:04,354 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L40-1-->L41-6: Formula: (and (< 3 v_~m~0_123) (= v_~j1~0_154 4) (< v_~i1~0_148 v_~n~0_111) (= v_~k1~0_137 (+ v_~k1~0_139 4))) InVars {~m~0=v_~m~0_123, ~k1~0=v_~k1~0_139, ~i1~0=v_~i1~0_148, ~n~0=v_~n~0_111} OutVars{~m~0=v_~m~0_123, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_55|, ~k1~0=v_~k1~0_137, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_57|, ~j1~0=v_~j1~0_154, ~i1~0=v_~i1~0_148, ~n~0=v_~n~0_111} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:04,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L40-1-->L41-6: Formula: (and (= v_~k1~0_109 (+ v_~k1~0_111 3)) (< v_~i1~0_114 v_~n~0_83) (= 3 v_~j1~0_110) (< 2 v_~m~0_93)) InVars {~m~0=v_~m~0_93, ~k1~0=v_~k1~0_111, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} OutVars{~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_37|, ~k1~0=v_~k1~0_109, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_39|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [421] L51-1-->L51-1: Formula: (and (= (+ v_~k2~0_123 (* 2 v_~m~0_113)) v_~k2~0_121) (= (+ 2 v_~i2~0_120) v_~i2~0_118) (< v_~i2~0_118 (+ v_~n~0_101 1))) InVars {~m~0=v_~m~0_113, ~k2~0=v_~k2~0_123, ~i2~0=v_~i2~0_120, ~n~0=v_~n~0_101} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_53|, ~m~0=v_~m~0_113, ~k2~0=v_~k2~0_121, ~i2~0=v_~i2~0_118, ~n~0=v_~n~0_101} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:04,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L40-1-->L41-6: Formula: (and (= v_~k1~0_109 (+ v_~k1~0_111 3)) (< v_~i1~0_114 v_~n~0_83) (= 3 v_~j1~0_110) (< 2 v_~m~0_93)) InVars {~m~0=v_~m~0_93, ~k1~0=v_~k1~0_111, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} OutVars{~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_37|, ~k1~0=v_~k1~0_109, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_39|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [424] L51-1-->L41-6: Formula: (and (< v_~i2~0_133 v_~n~0_107) (= v_~k2~0_135 (+ v_~k2~0_136 v_~m~0_119)) (< v_~j1~0_149 v_~m~0_119) (= (+ v_~i2~0_133 1) v_~i2~0_132) (= (+ v_~j1~0_149 1) v_~j1~0_148) (= v_~k1~0_133 (+ v_~k1~0_134 1))) InVars {~m~0=v_~m~0_119, ~k1~0=v_~k1~0_134, ~k2~0=v_~k2~0_136, ~j1~0=v_~j1~0_149, ~i2~0=v_~i2~0_133, ~n~0=v_~n~0_107} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_61|, ~m~0=v_~m~0_119, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_53|, ~k1~0=v_~k1~0_133, ~k2~0=v_~k2~0_135, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_55|, ~j1~0=v_~j1~0_148, ~i2~0=v_~i2~0_132, ~n~0=v_~n~0_107} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, ~k1~0, ~k2~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0, ~i2~0] [2022-12-06 05:15:04,572 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L40-1-->L41-6: Formula: (and (= v_~k1~0_109 (+ v_~k1~0_111 3)) (< v_~i1~0_114 v_~n~0_83) (= 3 v_~j1~0_110) (< 2 v_~m~0_93)) InVars {~m~0=v_~m~0_93, ~k1~0=v_~k1~0_111, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} OutVars{~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_37|, ~k1~0=v_~k1~0_109, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_39|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [429] L51-1-->L41-6: Formula: (and (not (< v_~j1~0_167 v_~m~0_129)) (< v_~i2~0_145 v_~n~0_117) (= (+ v_~k2~0_148 v_~m~0_129) v_~k2~0_147) (< v_~i1~0_156 v_~n~0_117) (= (+ v_~i2~0_145 1) v_~i2~0_144) (= v_~j1~0_166 0) (= (+ v_~i1~0_157 1) v_~i1~0_156)) InVars {~m~0=v_~m~0_129, ~k2~0=v_~k2~0_148, ~j1~0=v_~j1~0_167, ~i2~0=v_~i2~0_145, ~i1~0=v_~i1~0_157, ~n~0=v_~n~0_117} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_67|, ~m~0=v_~m~0_129, ~k2~0=v_~k2~0_147, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_61|, ~j1~0=v_~j1~0_166, ~i2~0=v_~i2~0_144, ~i1~0=v_~i1~0_156, ~n~0=v_~n~0_117} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i2~0, ~i1~0] [2022-12-06 05:15:04,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L40-1-->L41-6: Formula: (and (= v_~k1~0_109 (+ v_~k1~0_111 3)) (< v_~i1~0_114 v_~n~0_83) (= 3 v_~j1~0_110) (< 2 v_~m~0_93)) InVars {~m~0=v_~m~0_93, ~k1~0=v_~k1~0_111, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} OutVars{~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_37|, ~k1~0=v_~k1~0_109, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_39|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [430] L51-1-->L51-1: Formula: (and (not (< v_~j1~0_170 v_~m~0_131)) (= v_~k2~0_151 (+ v_~k2~0_153 (* 2 v_~m~0_131))) (= (+ v_~i1~0_161 1) v_~i1~0_160) (< (+ v_~i2~0_150 1) v_~n~0_119) (= (+ 2 v_~i2~0_150) v_~i2~0_148)) InVars {~m~0=v_~m~0_131, ~k2~0=v_~k2~0_153, ~i2~0=v_~i2~0_150, ~j1~0=v_~j1~0_170, ~i1~0=v_~i1~0_161, ~n~0=v_~n~0_119} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_69|, ~m~0=v_~m~0_131, ~k2~0=v_~k2~0_151, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_63|, ~i2~0=v_~i2~0_148, ~j1~0=v_~j1~0_170, ~i1~0=v_~i1~0_160, ~n~0=v_~n~0_119} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0] [2022-12-06 05:15:04,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L40-1-->L41-6: Formula: (and (= v_~k1~0_109 (+ v_~k1~0_111 3)) (< v_~i1~0_114 v_~n~0_83) (= 3 v_~j1~0_110) (< 2 v_~m~0_93)) InVars {~m~0=v_~m~0_93, ~k1~0=v_~k1~0_111, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} OutVars{~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_37|, ~k1~0=v_~k1~0_109, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_39|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:04,789 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:15:04,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 557 [2022-12-06 05:15:04,790 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 395 transitions, 6071 flow [2022-12-06 05:15:04,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:04,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:04,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:04,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:15:04,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 05:15:04,994 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:15:04,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:04,995 INFO L85 PathProgramCache]: Analyzing trace with hash -103742838, now seen corresponding path program 1 times [2022-12-06 05:15:04,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:04,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164332108] [2022-12-06 05:15:04,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:05,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:05,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164332108] [2022-12-06 05:15:05,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164332108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:05,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:05,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:05,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384416658] [2022-12-06 05:15:05,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:05,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:05,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:05,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:05,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:05,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:15:05,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 395 transitions, 6071 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:05,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:05,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:15:05,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:05,514 INFO L130 PetriNetUnfolder]: 1499/2487 cut-off events. [2022-12-06 05:15:05,514 INFO L131 PetriNetUnfolder]: For 27312/27312 co-relation queries the response was YES. [2022-12-06 05:15:05,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17962 conditions, 2487 events. 1499/2487 cut-off events. For 27312/27312 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13496 event pairs, 386 based on Foata normal form. 58/2529 useless extension candidates. Maximal degree in co-relation 17835. Up to 2163 conditions per place. [2022-12-06 05:15:05,555 INFO L137 encePairwiseOnDemand]: 28/48 looper letters, 374 selfloop transitions, 34 changer transitions 0/408 dead transitions. [2022-12-06 05:15:05,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 408 transitions, 7130 flow [2022-12-06 05:15:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:15:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:15:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 05:15:05,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2022-12-06 05:15:05,556 INFO L175 Difference]: Start difference. First operand has 117 places, 395 transitions, 6071 flow. Second operand 4 states and 70 transitions. [2022-12-06 05:15:05,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 408 transitions, 7130 flow [2022-12-06 05:15:05,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 408 transitions, 6921 flow, removed 94 selfloop flow, removed 3 redundant places. [2022-12-06 05:15:05,685 INFO L231 Difference]: Finished difference. Result has 117 places, 382 transitions, 5957 flow [2022-12-06 05:15:05,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5571, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5957, PETRI_PLACES=117, PETRI_TRANSITIONS=382} [2022-12-06 05:15:05,686 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 98 predicate places. [2022-12-06 05:15:05,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:05,686 INFO L89 Accepts]: Start accepts. Operand has 117 places, 382 transitions, 5957 flow [2022-12-06 05:15:05,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:05,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:05,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 382 transitions, 5957 flow [2022-12-06 05:15:05,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 382 transitions, 5957 flow [2022-12-06 05:15:05,775 INFO L130 PetriNetUnfolder]: 497/1042 cut-off events. [2022-12-06 05:15:05,776 INFO L131 PetriNetUnfolder]: For 12163/12739 co-relation queries the response was YES. [2022-12-06 05:15:05,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7197 conditions, 1042 events. 497/1042 cut-off events. For 12163/12739 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6317 event pairs, 0 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 7025. Up to 405 conditions per place. [2022-12-06 05:15:05,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 382 transitions, 5957 flow [2022-12-06 05:15:05,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 924 [2022-12-06 05:15:05,787 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:05,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 05:15:05,788 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 382 transitions, 5957 flow [2022-12-06 05:15:05,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:05,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:05,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:05,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:15:05,811 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:15:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1819133586, now seen corresponding path program 1 times [2022-12-06 05:15:05,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:05,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051389400] [2022-12-06 05:15:05,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:05,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:06,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:06,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051389400] [2022-12-06 05:15:06,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051389400] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:06,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979130855] [2022-12-06 05:15:06,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:06,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:06,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:06,113 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:15:06,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:15:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:06,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:15:06,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:08,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:09,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979130855] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:09,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:09,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-06 05:15:09,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114873291] [2022-12-06 05:15:09,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:09,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:15:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:09,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:15:09,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=92, Unknown=1, NotChecked=0, Total=132 [2022-12-06 05:15:09,200 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 05:15:09,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 382 transitions, 5957 flow. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:09,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:09,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 05:15:09,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:12,897 INFO L130 PetriNetUnfolder]: 1597/2669 cut-off events. [2022-12-06 05:15:12,897 INFO L131 PetriNetUnfolder]: For 27048/27048 co-relation queries the response was YES. [2022-12-06 05:15:12,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19362 conditions, 2669 events. 1597/2669 cut-off events. For 27048/27048 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 14918 event pairs, 6 based on Foata normal form. 2/2653 useless extension candidates. Maximal degree in co-relation 19055. Up to 2299 conditions per place. [2022-12-06 05:15:12,917 INFO L137 encePairwiseOnDemand]: 9/45 looper letters, 363 selfloop transitions, 104 changer transitions 21/488 dead transitions. [2022-12-06 05:15:12,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 488 transitions, 8175 flow [2022-12-06 05:15:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:15:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:15:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 146 transitions. [2022-12-06 05:15:12,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19084967320261437 [2022-12-06 05:15:12,921 INFO L175 Difference]: Start difference. First operand has 117 places, 382 transitions, 5957 flow. Second operand 17 states and 146 transitions. [2022-12-06 05:15:12,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 488 transitions, 8175 flow [2022-12-06 05:15:13,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 488 transitions, 8031 flow, removed 63 selfloop flow, removed 3 redundant places. [2022-12-06 05:15:13,124 INFO L231 Difference]: Finished difference. Result has 136 places, 421 transitions, 6775 flow [2022-12-06 05:15:13,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=5890, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6775, PETRI_PLACES=136, PETRI_TRANSITIONS=421} [2022-12-06 05:15:13,124 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 117 predicate places. [2022-12-06 05:15:13,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:13,125 INFO L89 Accepts]: Start accepts. Operand has 136 places, 421 transitions, 6775 flow [2022-12-06 05:15:13,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:13,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:13,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 421 transitions, 6775 flow [2022-12-06 05:15:13,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 421 transitions, 6775 flow [2022-12-06 05:15:13,225 INFO L130 PetriNetUnfolder]: 522/1101 cut-off events. [2022-12-06 05:15:13,225 INFO L131 PetriNetUnfolder]: For 13584/14572 co-relation queries the response was YES. [2022-12-06 05:15:13,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7809 conditions, 1101 events. 522/1101 cut-off events. For 13584/14572 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6786 event pairs, 0 based on Foata normal form. 3/1096 useless extension candidates. Maximal degree in co-relation 7715. Up to 410 conditions per place. [2022-12-06 05:15:13,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 421 transitions, 6775 flow [2022-12-06 05:15:13,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 1026 [2022-12-06 05:15:13,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:13,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [434] L40-1-->L41-6: Formula: (and (< 2 v_~m~0_139) (<= v_~m~0_139 3) (< v_~i2~0_168 v_~n~0_127) (= (+ v_~k1~0_165 3) v_~k1~0_164) (< v_~i1~0_172 v_~n~0_127) (= v_~k2~0_170 (+ v_~k2~0_171 v_~m~0_139)) (= v_~j1~0_182 0) (= v_~i2~0_167 (+ v_~i2~0_168 1)) (= v_~i1~0_172 (+ v_~i1~0_173 1))) InVars {~m~0=v_~m~0_139, ~k2~0=v_~k2~0_171, ~k1~0=v_~k1~0_165, ~i2~0=v_~i2~0_168, ~i1~0=v_~i1~0_173, ~n~0=v_~n~0_127} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_81|, ~m~0=v_~m~0_139, ~k2~0=v_~k2~0_170, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_73|, ~k1~0=v_~k1~0_164, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_75|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_67|, ~j1~0=v_~j1~0_182, ~i2~0=v_~i2~0_167, ~i1~0=v_~i1~0_172, ~n~0=v_~n~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i2~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:13,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [396] L51-1-->L41-6: Formula: (and (= v_~j1~0_68 0) (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (< v_~i1~0_68 v_~n~0_53) (not (< v_~i2~0_62 v_~n~0_53))) InVars {~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~j1~0=v_~j1~0_68, ~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-06 05:15:13,699 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:13,752 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:14,040 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] L40-1-->L41-6: Formula: (and (< v_~j1~0_158 (+ v_~m~0_125 1)) (= v_~k1~0_143 (+ v_~k1~0_145 5)) (< v_~i1~0_150 v_~n~0_113) (= 5 v_~j1~0_158)) InVars {~m~0=v_~m~0_125, ~k1~0=v_~k1~0_145, ~i1~0=v_~i1~0_150, ~n~0=v_~n~0_113} OutVars{~m~0=v_~m~0_125, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_59|, ~k1~0=v_~k1~0_143, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_61|, ~j1~0=v_~j1~0_158, ~i1~0=v_~i1~0_150, ~n~0=v_~n~0_113} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:14,275 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:15:14,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1151 [2022-12-06 05:15:14,275 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 420 transitions, 6914 flow [2022-12-06 05:15:14,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:14,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:14,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:14,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:15:14,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:14,486 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:15:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash -459016846, now seen corresponding path program 1 times [2022-12-06 05:15:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:14,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351327491] [2022-12-06 05:15:14,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:14,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:14,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:14,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351327491] [2022-12-06 05:15:14,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351327491] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:14,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744994255] [2022-12-06 05:15:14,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:14,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:14,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:14,556 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:15:14,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:15:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:14,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:15:14,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:14,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:14,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744994255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:14,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:14,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:15:14,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457655172] [2022-12-06 05:15:14,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:14,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:15:14,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:14,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:15:14,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:15:14,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:15:14,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 420 transitions, 6914 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:14,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:14,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:15:14,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:15,841 INFO L130 PetriNetUnfolder]: 2790/4557 cut-off events. [2022-12-06 05:15:15,841 INFO L131 PetriNetUnfolder]: For 54184/54184 co-relation queries the response was YES. [2022-12-06 05:15:15,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34469 conditions, 4557 events. 2790/4557 cut-off events. For 54184/54184 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 27315 event pairs, 10 based on Foata normal form. 108/4641 useless extension candidates. Maximal degree in co-relation 34260. Up to 1685 conditions per place. [2022-12-06 05:15:15,931 INFO L137 encePairwiseOnDemand]: 12/58 looper letters, 474 selfloop transitions, 493 changer transitions 6/973 dead transitions. [2022-12-06 05:15:15,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 973 transitions, 16978 flow [2022-12-06 05:15:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:15:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:15:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 139 transitions. [2022-12-06 05:15:15,934 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17118226600985223 [2022-12-06 05:15:15,934 INFO L175 Difference]: Start difference. First operand has 135 places, 420 transitions, 6914 flow. Second operand 14 states and 139 transitions. [2022-12-06 05:15:15,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 973 transitions, 16978 flow [2022-12-06 05:15:16,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 973 transitions, 16575 flow, removed 147 selfloop flow, removed 6 redundant places. [2022-12-06 05:15:16,286 INFO L231 Difference]: Finished difference. Result has 151 places, 712 transitions, 13649 flow [2022-12-06 05:15:16,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=6552, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13649, PETRI_PLACES=151, PETRI_TRANSITIONS=712} [2022-12-06 05:15:16,287 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 132 predicate places. [2022-12-06 05:15:16,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:16,287 INFO L89 Accepts]: Start accepts. Operand has 151 places, 712 transitions, 13649 flow [2022-12-06 05:15:16,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:16,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:16,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 712 transitions, 13649 flow [2022-12-06 05:15:16,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 712 transitions, 13649 flow [2022-12-06 05:15:16,542 INFO L130 PetriNetUnfolder]: 957/1924 cut-off events. [2022-12-06 05:15:16,542 INFO L131 PetriNetUnfolder]: For 36917/37433 co-relation queries the response was YES. [2022-12-06 05:15:16,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16310 conditions, 1924 events. 957/1924 cut-off events. For 36917/37433 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 12877 event pairs, 12 based on Foata normal form. 8/1922 useless extension candidates. Maximal degree in co-relation 16204. Up to 759 conditions per place. [2022-12-06 05:15:16,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 712 transitions, 13649 flow [2022-12-06 05:15:16,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 1604 [2022-12-06 05:15:16,568 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:16,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 282 [2022-12-06 05:15:16,569 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 712 transitions, 13649 flow [2022-12-06 05:15:16,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:16,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:16,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:16,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:15:16,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:16,773 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:15:16,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:16,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2046599558, now seen corresponding path program 1 times [2022-12-06 05:15:16,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:16,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922734591] [2022-12-06 05:15:16,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:16,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:16,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:16,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922734591] [2022-12-06 05:15:16,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922734591] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:16,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870086966] [2022-12-06 05:15:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:16,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:16,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:16,983 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:15:16,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:15:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:17,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:15:17,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:18,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:19,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870086966] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:19,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:19,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-06 05:15:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786247154] [2022-12-06 05:15:19,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:19,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:15:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:19,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:15:19,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:15:19,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:15:19,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 712 transitions, 13649 flow. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:19,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:19,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:15:19,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:21,732 INFO L130 PetriNetUnfolder]: 2959/4860 cut-off events. [2022-12-06 05:15:21,732 INFO L131 PetriNetUnfolder]: For 81033/81033 co-relation queries the response was YES. [2022-12-06 05:15:21,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41819 conditions, 4860 events. 2959/4860 cut-off events. For 81033/81033 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 29782 event pairs, 28 based on Foata normal form. 2/4834 useless extension candidates. Maximal degree in co-relation 41499. Up to 4284 conditions per place. [2022-12-06 05:15:21,780 INFO L137 encePairwiseOnDemand]: 9/56 looper letters, 679 selfloop transitions, 165 changer transitions 36/880 dead transitions. [2022-12-06 05:15:21,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 880 transitions, 18051 flow [2022-12-06 05:15:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:15:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:15:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 187 transitions. [2022-12-06 05:15:21,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18551587301587302 [2022-12-06 05:15:21,782 INFO L175 Difference]: Start difference. First operand has 148 places, 712 transitions, 13649 flow. Second operand 18 states and 187 transitions. [2022-12-06 05:15:21,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 880 transitions, 18051 flow [2022-12-06 05:15:22,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 880 transitions, 17289 flow, removed 362 selfloop flow, removed 2 redundant places. [2022-12-06 05:15:22,420 INFO L231 Difference]: Finished difference. Result has 172 places, 782 transitions, 14967 flow [2022-12-06 05:15:22,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=13034, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=14967, PETRI_PLACES=172, PETRI_TRANSITIONS=782} [2022-12-06 05:15:22,420 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 153 predicate places. [2022-12-06 05:15:22,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:22,421 INFO L89 Accepts]: Start accepts. Operand has 172 places, 782 transitions, 14967 flow [2022-12-06 05:15:22,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:22,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:22,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 782 transitions, 14967 flow [2022-12-06 05:15:22,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 782 transitions, 14967 flow [2022-12-06 05:15:22,710 INFO L130 PetriNetUnfolder]: 1012/2052 cut-off events. [2022-12-06 05:15:22,710 INFO L131 PetriNetUnfolder]: For 35797/36697 co-relation queries the response was YES. [2022-12-06 05:15:22,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17199 conditions, 2052 events. 1012/2052 cut-off events. For 35797/36697 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 14083 event pairs, 10 based on Foata normal form. 11/2053 useless extension candidates. Maximal degree in co-relation 17015. Up to 846 conditions per place. [2022-12-06 05:15:22,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 782 transitions, 14967 flow [2022-12-06 05:15:22,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 1770 [2022-12-06 05:15:22,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [451] L40-1-->L41-6: Formula: (and (= v_~k1~0_228 (+ v_~k1~0_230 7)) (< v_~i1~0_221 v_~n~0_159) (= 7 v_~j1~0_243) (< v_~j1~0_243 (+ v_~m~0_173 1))) InVars {~m~0=v_~m~0_173, ~k1~0=v_~k1~0_230, ~i1~0=v_~i1~0_221, ~n~0=v_~n~0_159} OutVars{~m~0=v_~m~0_173, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_111|, ~k1~0=v_~k1~0_228, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_113|, ~j1~0=v_~j1~0_243, ~i1~0=v_~i1~0_221, ~n~0=v_~n~0_159} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:22,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:22,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [396] L51-1-->L41-6: Formula: (and (= v_~j1~0_68 0) (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (< v_~i1~0_68 v_~n~0_53) (not (< v_~i2~0_62 v_~n~0_53))) InVars {~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~j1~0=v_~j1~0_68, ~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-06 05:15:23,119 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [396] L51-1-->L41-6: Formula: (and (= v_~j1~0_68 0) (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (< v_~i1~0_68 v_~n~0_53) (not (< v_~i2~0_62 v_~n~0_53))) InVars {~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~j1~0=v_~j1~0_68, ~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-06 05:15:23,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:23,301 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:15:23,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 881 [2022-12-06 05:15:23,302 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 781 transitions, 15040 flow [2022-12-06 05:15:23,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:23,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:23,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:23,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:15:23,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 05:15:23,507 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:15:23,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:23,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1830476228, now seen corresponding path program 1 times [2022-12-06 05:15:23,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:23,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444996421] [2022-12-06 05:15:23,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:23,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:23,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:23,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444996421] [2022-12-06 05:15:23,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444996421] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:23,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805990069] [2022-12-06 05:15:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:23,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:23,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:23,561 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:15:23,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 05:15:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:23,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:15:23,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:23,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:23,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805990069] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:23,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:23,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:15:23,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605173527] [2022-12-06 05:15:23,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:23,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:15:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:23,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:15:23,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:15:23,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 05:15:23,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 781 transitions, 15040 flow. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 05:15:23,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:23,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 05:15:23,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:25,180 INFO L130 PetriNetUnfolder]: 3274/5397 cut-off events. [2022-12-06 05:15:25,180 INFO L131 PetriNetUnfolder]: For 90429/90429 co-relation queries the response was YES. [2022-12-06 05:15:25,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45516 conditions, 5397 events. 3274/5397 cut-off events. For 90429/90429 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 34158 event pairs, 639 based on Foata normal form. 286/5655 useless extension candidates. Maximal degree in co-relation 45184. Up to 3631 conditions per place. [2022-12-06 05:15:25,228 INFO L137 encePairwiseOnDemand]: 27/64 looper letters, 799 selfloop transitions, 136 changer transitions 0/935 dead transitions. [2022-12-06 05:15:25,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 935 transitions, 19496 flow [2022-12-06 05:15:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:15:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:15:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2022-12-06 05:15:25,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2204861111111111 [2022-12-06 05:15:25,230 INFO L175 Difference]: Start difference. First operand has 171 places, 781 transitions, 15040 flow. Second operand 9 states and 127 transitions. [2022-12-06 05:15:25,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 935 transitions, 19496 flow [2022-12-06 05:15:25,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 935 transitions, 19101 flow, removed 171 selfloop flow, removed 5 redundant places. [2022-12-06 05:15:25,919 INFO L231 Difference]: Finished difference. Result has 177 places, 787 transitions, 15247 flow [2022-12-06 05:15:25,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=13920, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15247, PETRI_PLACES=177, PETRI_TRANSITIONS=787} [2022-12-06 05:15:25,920 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 158 predicate places. [2022-12-06 05:15:25,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:25,920 INFO L89 Accepts]: Start accepts. Operand has 177 places, 787 transitions, 15247 flow [2022-12-06 05:15:25,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:25,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:25,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 787 transitions, 15247 flow [2022-12-06 05:15:25,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 787 transitions, 15247 flow [2022-12-06 05:15:26,237 INFO L130 PetriNetUnfolder]: 1104/2250 cut-off events. [2022-12-06 05:15:26,238 INFO L131 PetriNetUnfolder]: For 47675/50075 co-relation queries the response was YES. [2022-12-06 05:15:26,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20043 conditions, 2250 events. 1104/2250 cut-off events. For 47675/50075 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 15892 event pairs, 26 based on Foata normal form. 1/2241 useless extension candidates. Maximal degree in co-relation 19811. Up to 1020 conditions per place. [2022-12-06 05:15:26,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 787 transitions, 15247 flow [2022-12-06 05:15:26,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 1816 [2022-12-06 05:15:26,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:15:26,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 493 [2022-12-06 05:15:26,413 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 787 transitions, 15266 flow [2022-12-06 05:15:26,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 05:15:26,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:26,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:26,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 05:15:26,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 05:15:26,617 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:15:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash -922805867, now seen corresponding path program 1 times [2022-12-06 05:15:26,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:26,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058230943] [2022-12-06 05:15:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:26,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:26,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058230943] [2022-12-06 05:15:26,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058230943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:26,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:26,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:15:26,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808332191] [2022-12-06 05:15:26,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:26,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:26,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:26,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:26,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:26,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 05:15:26,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 787 transitions, 15266 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 05:15:26,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:26,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 05:15:26,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:28,598 INFO L130 PetriNetUnfolder]: 4334/7336 cut-off events. [2022-12-06 05:15:28,598 INFO L131 PetriNetUnfolder]: For 142926/142926 co-relation queries the response was YES. [2022-12-06 05:15:28,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64489 conditions, 7336 events. 4334/7336 cut-off events. For 142926/142926 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 49849 event pairs, 514 based on Foata normal form. 122/7430 useless extension candidates. Maximal degree in co-relation 64281. Up to 4125 conditions per place. [2022-12-06 05:15:28,668 INFO L137 encePairwiseOnDemand]: 31/64 looper letters, 843 selfloop transitions, 297 changer transitions 3/1143 dead transitions. [2022-12-06 05:15:28,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 1143 transitions, 23843 flow [2022-12-06 05:15:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:15:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:15:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-06 05:15:28,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33984375 [2022-12-06 05:15:28,670 INFO L175 Difference]: Start difference. First operand has 177 places, 787 transitions, 15266 flow. Second operand 4 states and 87 transitions. [2022-12-06 05:15:28,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 1143 transitions, 23843 flow [2022-12-06 05:15:29,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 1143 transitions, 23473 flow, removed 92 selfloop flow, removed 2 redundant places. [2022-12-06 05:15:29,689 INFO L231 Difference]: Finished difference. Result has 180 places, 943 transitions, 19260 flow [2022-12-06 05:15:29,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=14756, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=19260, PETRI_PLACES=180, PETRI_TRANSITIONS=943} [2022-12-06 05:15:29,689 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 161 predicate places. [2022-12-06 05:15:29,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:29,690 INFO L89 Accepts]: Start accepts. Operand has 180 places, 943 transitions, 19260 flow [2022-12-06 05:15:29,692 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:29,692 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:29,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 943 transitions, 19260 flow [2022-12-06 05:15:29,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 943 transitions, 19260 flow [2022-12-06 05:15:30,191 INFO L130 PetriNetUnfolder]: 1460/3137 cut-off events. [2022-12-06 05:15:30,191 INFO L131 PetriNetUnfolder]: For 75304/77945 co-relation queries the response was YES. [2022-12-06 05:15:30,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28213 conditions, 3137 events. 1460/3137 cut-off events. For 75304/77945 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 24427 event pairs, 45 based on Foata normal form. 1/3128 useless extension candidates. Maximal degree in co-relation 28080. Up to 1370 conditions per place. [2022-12-06 05:15:30,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 943 transitions, 19260 flow [2022-12-06 05:15:30,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 2128 [2022-12-06 05:15:30,237 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:30,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 548 [2022-12-06 05:15:30,237 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 943 transitions, 19260 flow [2022-12-06 05:15:30,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 05:15:30,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:30,238 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:30,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:15:30,238 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:15:30,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:30,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1553796145, now seen corresponding path program 1 times [2022-12-06 05:15:30,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:30,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598331638] [2022-12-06 05:15:30,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:30,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:30,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598331638] [2022-12-06 05:15:30,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598331638] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370042576] [2022-12-06 05:15:30,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:30,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:30,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:30,476 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:15:30,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 05:15:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:30,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 05:15:30,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:30,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:31,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370042576] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:31,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:31,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-06 05:15:31,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133711263] [2022-12-06 05:15:31,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:31,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:15:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:31,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:15:31,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:15:31,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:15:31,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 943 transitions, 19260 flow. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:31,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:31,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:15:31,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:34,362 INFO L130 PetriNetUnfolder]: 4580/7804 cut-off events. [2022-12-06 05:15:34,362 INFO L131 PetriNetUnfolder]: For 163391/163391 co-relation queries the response was YES. [2022-12-06 05:15:34,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70755 conditions, 7804 events. 4580/7804 cut-off events. For 163391/163391 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 54341 event pairs, 58 based on Foata normal form. 5/7781 useless extension candidates. Maximal degree in co-relation 70502. Up to 5365 conditions per place. [2022-12-06 05:15:34,438 INFO L137 encePairwiseOnDemand]: 12/61 looper letters, 556 selfloop transitions, 547 changer transitions 19/1122 dead transitions. [2022-12-06 05:15:34,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 1122 transitions, 24846 flow [2022-12-06 05:15:34,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:15:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:15:34,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 146 transitions. [2022-12-06 05:15:34,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14959016393442623 [2022-12-06 05:15:34,439 INFO L175 Difference]: Start difference. First operand has 180 places, 943 transitions, 19260 flow. Second operand 16 states and 146 transitions. [2022-12-06 05:15:34,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 1122 transitions, 24846 flow [2022-12-06 05:15:35,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 1122 transitions, 24820 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-12-06 05:15:35,774 INFO L231 Difference]: Finished difference. Result has 201 places, 1072 transitions, 23956 flow [2022-12-06 05:15:35,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=19242, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=428, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=23956, PETRI_PLACES=201, PETRI_TRANSITIONS=1072} [2022-12-06 05:15:35,775 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 182 predicate places. [2022-12-06 05:15:35,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:35,775 INFO L89 Accepts]: Start accepts. Operand has 201 places, 1072 transitions, 23956 flow [2022-12-06 05:15:35,779 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:35,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:35,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 1072 transitions, 23956 flow [2022-12-06 05:15:35,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 1072 transitions, 23956 flow [2022-12-06 05:15:36,385 INFO L130 PetriNetUnfolder]: 1530/3305 cut-off events. [2022-12-06 05:15:36,386 INFO L131 PetriNetUnfolder]: For 87820/90671 co-relation queries the response was YES. [2022-12-06 05:15:36,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31821 conditions, 3305 events. 1530/3305 cut-off events. For 87820/90671 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 26151 event pairs, 25 based on Foata normal form. 2/3298 useless extension candidates. Maximal degree in co-relation 31679. Up to 1471 conditions per place. [2022-12-06 05:15:36,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 1072 transitions, 23956 flow [2022-12-06 05:15:36,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 2400 [2022-12-06 05:15:36,496 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:36,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:36,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L40-1-->L41-6: Formula: (and (= v_~i1~0_187 (+ v_~i1~0_188 1)) (= (+ v_~i2~0_185 1) v_~i2~0_184) (< v_~i1~0_187 v_~n~0_137) (< v_~i2~0_185 v_~n~0_137) (= v_~j1~0_197 1) (= v_~k2~0_188 (+ v_~k2~0_189 v_~m~0_149)) (<= v_~m~0_149 3) (= (+ v_~k1~0_184 4) v_~k1~0_182) (< 2 v_~m~0_149)) InVars {~m~0=v_~m~0_149, ~k1~0=v_~k1~0_184, ~k2~0=v_~k2~0_189, ~i2~0=v_~i2~0_185, ~i1~0=v_~i1~0_188, ~n~0=v_~n~0_137} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_91|, ~m~0=v_~m~0_149, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_83|, ~k1~0=v_~k1~0_182, ~k2~0=v_~k2~0_188, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_85|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_73|, ~j1~0=v_~j1~0_197, ~i2~0=v_~i2~0_184, ~i1~0=v_~i1~0_187, ~n~0=v_~n~0_137} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, ~k1~0, ~k2~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i2~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:36,947 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:37,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] L40-1-->L51-1: Formula: (and (= v_~k2~0_214 (+ v_~k2~0_215 v_~m~0_171)) (< v_~j1~0_239 (+ v_~m~0_171 1)) (= 6 v_~j1~0_239) (= v_~k1~0_222 (+ v_~k1~0_224 6)) (< v_~i1~0_219 v_~n~0_157) (< v_~i2~0_213 v_~n~0_157) (= v_~i2~0_212 (+ v_~i2~0_213 1))) InVars {~m~0=v_~m~0_171, ~k2~0=v_~k2~0_215, ~k1~0=v_~k1~0_224, ~i2~0=v_~i2~0_213, ~i1~0=v_~i1~0_219, ~n~0=v_~n~0_157} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_105|, ~m~0=v_~m~0_171, ~k2~0=v_~k2~0_214, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_107|, ~k1~0=v_~k1~0_222, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_109|, ~i2~0=v_~i2~0_212, ~j1~0=v_~j1~0_239, ~i1~0=v_~i1~0_219, ~n~0=v_~n~0_157} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] [2022-12-06 05:15:37,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] L40-1-->L51-1: Formula: (and (= v_~k2~0_214 (+ v_~k2~0_215 v_~m~0_171)) (< v_~j1~0_239 (+ v_~m~0_171 1)) (= 6 v_~j1~0_239) (= v_~k1~0_222 (+ v_~k1~0_224 6)) (< v_~i1~0_219 v_~n~0_157) (< v_~i2~0_213 v_~n~0_157) (= v_~i2~0_212 (+ v_~i2~0_213 1))) InVars {~m~0=v_~m~0_171, ~k2~0=v_~k2~0_215, ~k1~0=v_~k1~0_224, ~i2~0=v_~i2~0_213, ~i1~0=v_~i1~0_219, ~n~0=v_~n~0_157} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_105|, ~m~0=v_~m~0_171, ~k2~0=v_~k2~0_214, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_107|, ~k1~0=v_~k1~0_222, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_109|, ~i2~0=v_~i2~0_212, ~j1~0=v_~j1~0_239, ~i1~0=v_~i1~0_219, ~n~0=v_~n~0_157} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-06 05:15:37,255 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] L40-1-->L51-1: Formula: (and (= v_~k2~0_214 (+ v_~k2~0_215 v_~m~0_171)) (< v_~j1~0_239 (+ v_~m~0_171 1)) (= 6 v_~j1~0_239) (= v_~k1~0_222 (+ v_~k1~0_224 6)) (< v_~i1~0_219 v_~n~0_157) (< v_~i2~0_213 v_~n~0_157) (= v_~i2~0_212 (+ v_~i2~0_213 1))) InVars {~m~0=v_~m~0_171, ~k2~0=v_~k2~0_215, ~k1~0=v_~k1~0_224, ~i2~0=v_~i2~0_213, ~i1~0=v_~i1~0_219, ~n~0=v_~n~0_157} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_105|, ~m~0=v_~m~0_171, ~k2~0=v_~k2~0_214, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_107|, ~k1~0=v_~k1~0_222, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_109|, ~i2~0=v_~i2~0_212, ~j1~0=v_~j1~0_239, ~i1~0=v_~i1~0_219, ~n~0=v_~n~0_157} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [470] L41-6-->L41-6: Formula: (and (not (< v_~j1~0_321 v_~m~0_211)) (= v_~j1~0_320 0) (= v_~i1~0_281 (+ v_~i1~0_282 1)) (< v_~i1~0_281 v_~n~0_191)) InVars {~m~0=v_~m~0_211, ~j1~0=v_~j1~0_321, ~i1~0=v_~i1~0_282, ~n~0=v_~n~0_191} OutVars{~m~0=v_~m~0_211, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_117|, ~j1~0=v_~j1~0_320, ~i1~0=v_~i1~0_281, ~n~0=v_~n~0_191} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-06 05:15:37,352 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] L40-1-->L51-1: Formula: (and (= v_~k2~0_214 (+ v_~k2~0_215 v_~m~0_171)) (< v_~j1~0_239 (+ v_~m~0_171 1)) (= 6 v_~j1~0_239) (= v_~k1~0_222 (+ v_~k1~0_224 6)) (< v_~i1~0_219 v_~n~0_157) (< v_~i2~0_213 v_~n~0_157) (= v_~i2~0_212 (+ v_~i2~0_213 1))) InVars {~m~0=v_~m~0_171, ~k2~0=v_~k2~0_215, ~k1~0=v_~k1~0_224, ~i2~0=v_~i2~0_213, ~i1~0=v_~i1~0_219, ~n~0=v_~n~0_157} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_105|, ~m~0=v_~m~0_171, ~k2~0=v_~k2~0_214, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_107|, ~k1~0=v_~k1~0_222, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_109|, ~i2~0=v_~i2~0_212, ~j1~0=v_~j1~0_239, ~i1~0=v_~i1~0_219, ~n~0=v_~n~0_157} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [471] L41-6-->L51-1: Formula: (and (= (+ v_~k2~0_256 v_~m~0_213) v_~k2~0_255) (< v_~i2~0_257 v_~n~0_193) (not (< v_~j1~0_324 v_~m~0_213)) (= v_~i2~0_256 (+ v_~i2~0_257 1)) (= (+ v_~i1~0_286 1) v_~i1~0_285)) InVars {~m~0=v_~m~0_213, ~k2~0=v_~k2~0_256, ~i2~0=v_~i2~0_257, ~j1~0=v_~j1~0_324, ~i1~0=v_~i1~0_286, ~n~0=v_~n~0_193} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_131|, ~m~0=v_~m~0_213, ~k2~0=v_~k2~0_255, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_119|, ~i2~0=v_~i2~0_256, ~j1~0=v_~j1~0_324, ~i1~0=v_~i1~0_285, ~n~0=v_~n~0_193} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0] [2022-12-06 05:15:37,470 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:15:37,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1696 [2022-12-06 05:15:37,471 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 1071 transitions, 24171 flow [2022-12-06 05:15:37,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:37,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:37,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:37,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 05:15:37,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 05:15:37,676 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:15:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:37,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1285790831, now seen corresponding path program 1 times [2022-12-06 05:15:37,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:37,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915600892] [2022-12-06 05:15:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:37,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:37,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:37,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915600892] [2022-12-06 05:15:37,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915600892] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:37,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239577147] [2022-12-06 05:15:37,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:37,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:37,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:37,937 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:15:37,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 05:15:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:38,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 05:15:38,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:39,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:39,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239577147] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:39,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:39,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:15:39,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058909190] [2022-12-06 05:15:39,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:39,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:15:39,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:15:39,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:15:39,914 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 05:15:39,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 1071 transitions, 24171 flow. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:39,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:39,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 05:15:39,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:51,084 INFO L130 PetriNetUnfolder]: 4978/8492 cut-off events. [2022-12-06 05:15:51,085 INFO L131 PetriNetUnfolder]: For 195169/195169 co-relation queries the response was YES. [2022-12-06 05:15:51,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81899 conditions, 8492 events. 4978/8492 cut-off events. For 195169/195169 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 59941 event pairs, 44 based on Foata normal form. 2/8464 useless extension candidates. Maximal degree in co-relation 81593. Up to 5578 conditions per place. [2022-12-06 05:15:51,176 INFO L137 encePairwiseOnDemand]: 10/73 looper letters, 649 selfloop transitions, 689 changer transitions 32/1370 dead transitions. [2022-12-06 05:15:51,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1370 transitions, 32119 flow [2022-12-06 05:15:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 05:15:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 05:15:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 248 transitions. [2022-12-06 05:15:51,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11714690599905526 [2022-12-06 05:15:51,178 INFO L175 Difference]: Start difference. First operand has 200 places, 1071 transitions, 24171 flow. Second operand 29 states and 248 transitions. [2022-12-06 05:15:51,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1370 transitions, 32119 flow [2022-12-06 05:15:52,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 1370 transitions, 31355 flow, removed 304 selfloop flow, removed 7 redundant places. [2022-12-06 05:15:52,801 INFO L231 Difference]: Finished difference. Result has 233 places, 1259 transitions, 30572 flow [2022-12-06 05:15:52,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=23484, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1071, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=524, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=30572, PETRI_PLACES=233, PETRI_TRANSITIONS=1259} [2022-12-06 05:15:52,802 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 214 predicate places. [2022-12-06 05:15:52,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:52,802 INFO L89 Accepts]: Start accepts. Operand has 233 places, 1259 transitions, 30572 flow [2022-12-06 05:15:52,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:52,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:52,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 1259 transitions, 30572 flow [2022-12-06 05:15:52,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 1259 transitions, 30572 flow [2022-12-06 05:15:53,638 INFO L130 PetriNetUnfolder]: 1656/3598 cut-off events. [2022-12-06 05:15:53,638 INFO L131 PetriNetUnfolder]: For 105822/108811 co-relation queries the response was YES. [2022-12-06 05:15:53,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37090 conditions, 3598 events. 1656/3598 cut-off events. For 105822/108811 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 29034 event pairs, 22 based on Foata normal form. 2/3592 useless extension candidates. Maximal degree in co-relation 36920. Up to 1593 conditions per place. [2022-12-06 05:15:53,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 1259 transitions, 30572 flow [2022-12-06 05:15:53,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 2850 [2022-12-06 05:15:53,798 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] [2022-12-06 05:15:53,833 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:53,944 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:54,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [477] L51-1-->L51-1: Formula: (and (= v_~i2~0_285 (+ 2 v_~i2~0_287)) (< v_~i2~0_285 (+ v_~n~0_205 1)) (= v_~k2~0_285 (+ v_~k2~0_287 (* 2 v_~m~0_225)))) InVars {~m~0=v_~m~0_225, ~k2~0=v_~k2~0_287, ~i2~0=v_~i2~0_287, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_149|, ~m~0=v_~m~0_225, ~k2~0=v_~k2~0_285, ~i2~0=v_~i2~0_285, ~n~0=v_~n~0_205} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:54,108 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [478] L51-1-->L41-6: Formula: (and (= v_~i2~0_291 (+ v_~i2~0_292 1)) (= |v_thread2Thread1of1ForFork1_#res.offset_46| 0) (< v_~i2~0_292 v_~n~0_207) (not (< v_~i2~0_291 v_~n~0_207)) (= v_~j1~0_343 0) (= (+ v_~k2~0_292 v_~m~0_227) v_~k2~0_291) (< v_~i1~0_306 v_~n~0_207) (= |v_thread2Thread1of1ForFork1_#res.base_46| 0)) InVars {~m~0=v_~m~0_227, ~k2~0=v_~k2~0_292, ~i2~0=v_~i2~0_292, ~i1~0=v_~i1~0_306, ~n~0=v_~n~0_207} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_46|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_153|, ~m~0=v_~m~0_227, ~k2~0=v_~k2~0_291, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_46|, ~j1~0=v_~j1~0_343, ~i2~0=v_~i2~0_291, ~i1~0=v_~i1~0_306, ~n~0=v_~n~0_207} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread2Thread1of1ForFork1_#res.base, ~j1~0, ~i2~0] [2022-12-06 05:15:54,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [479] L51-1-->L41-6: Formula: (and (< v_~i2~0_296 v_~n~0_209) (= (+ v_~i2~0_296 1) v_~i2~0_295) (= v_~j1~0_345 0) (< v_~i1~0_308 v_~n~0_209) (= v_~k2~0_295 (+ v_~k2~0_296 v_~m~0_229))) InVars {~m~0=v_~m~0_229, ~k2~0=v_~k2~0_296, ~i2~0=v_~i2~0_296, ~i1~0=v_~i1~0_308, ~n~0=v_~n~0_209} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_155|, ~m~0=v_~m~0_229, ~k2~0=v_~k2~0_295, ~j1~0=v_~j1~0_345, ~i2~0=v_~i2~0_295, ~i1~0=v_~i1~0_308, ~n~0=v_~n~0_209} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~j1~0, ~i2~0] [2022-12-06 05:15:54,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] L40-1-->L41-6: Formula: (and (= (+ v_~k1~0_239 8) v_~k1~0_237) (< v_~i1~0_226 v_~n~0_161) (< 7 v_~m~0_175) (= 8 v_~j1~0_249)) InVars {~m~0=v_~m~0_175, ~k1~0=v_~k1~0_239, ~i1~0=v_~i1~0_226, ~n~0=v_~n~0_161} OutVars{~m~0=v_~m~0_175, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_119|, ~k1~0=v_~k1~0_237, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_121|, ~j1~0=v_~j1~0_249, ~i1~0=v_~i1~0_226, ~n~0=v_~n~0_161} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:55,220 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:55,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:55,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:55,443 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L40-1-->L41-6: Formula: (and (= (+ v_~k2~0_274 v_~m~0_221) v_~k2~0_273) (< 5 v_~m~0_221) (= v_~k1~0_299 (+ v_~k1~0_300 6)) (< v_~i2~0_275 v_~n~0_201) (< v_~i1~0_297 v_~n~0_201) (<= v_~m~0_221 6) (= v_~i2~0_274 (+ v_~i2~0_275 1)) (= v_~i1~0_297 (+ v_~i1~0_298 1)) (= v_~j1~0_334 0)) InVars {~m~0=v_~m~0_221, ~k2~0=v_~k2~0_274, ~k1~0=v_~k1~0_300, ~i2~0=v_~i2~0_275, ~i1~0=v_~i1~0_298, ~n~0=v_~n~0_201} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_141|, ~m~0=v_~m~0_221, ~k2~0=v_~k2~0_273, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_158|, ~k1~0=v_~k1~0_299, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_160|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_123|, ~j1~0=v_~j1~0_334, ~i2~0=v_~i2~0_274, ~i1~0=v_~i1~0_297, ~n~0=v_~n~0_201} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i2~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:55,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L40-1-->L41-6: Formula: (and (< v_~i1~0_364 v_~n~0_239) (= v_~k1~0_339 (+ v_~k1~0_341 9)) (= 9 v_~j1~0_389) (< 8 v_~m~0_259)) InVars {~m~0=v_~m~0_259, ~k1~0=v_~k1~0_341, ~i1~0=v_~i1~0_364, ~n~0=v_~n~0_239} OutVars{~m~0=v_~m~0_259, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_179|, ~k1~0=v_~k1~0_339, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_181|, ~j1~0=v_~j1~0_389, ~i1~0=v_~i1~0_364, ~n~0=v_~n~0_239} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:55,999 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:15:56,148 INFO L203 LiptonReduction]: Total number of compositions: 11 [2022-12-06 05:15:56,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3347 [2022-12-06 05:15:56,149 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 1255 transitions, 30854 flow [2022-12-06 05:15:56,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:56,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:56,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:56,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 05:15:56,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 05:15:56,353 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:15:56,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash 969923830, now seen corresponding path program 1 times [2022-12-06 05:15:56,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:56,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586890227] [2022-12-06 05:15:56,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:56,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:56,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586890227] [2022-12-06 05:15:56,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586890227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:56,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339851139] [2022-12-06 05:15:56,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:56,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:56,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:56,573 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:15:56,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 05:15:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:56,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 05:15:56,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:56,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:57,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339851139] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:57,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:57,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-06 05:15:57,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445314126] [2022-12-06 05:15:57,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:57,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:15:57,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:57,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:15:57,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:15:57,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 93 [2022-12-06 05:15:57,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 1255 transitions, 30854 flow. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:57,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:57,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 93 [2022-12-06 05:15:57,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:02,240 INFO L130 PetriNetUnfolder]: 5135/8755 cut-off events. [2022-12-06 05:16:02,241 INFO L131 PetriNetUnfolder]: For 223936/223936 co-relation queries the response was YES. [2022-12-06 05:16:02,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90137 conditions, 8755 events. 5135/8755 cut-off events. For 223936/223936 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 62024 event pairs, 48 based on Foata normal form. 2/8733 useless extension candidates. Maximal degree in co-relation 89812. Up to 5950 conditions per place. [2022-12-06 05:16:02,332 INFO L137 encePairwiseOnDemand]: 11/93 looper letters, 645 selfloop transitions, 721 changer transitions 22/1388 dead transitions. [2022-12-06 05:16:02,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 1388 transitions, 36221 flow [2022-12-06 05:16:02,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:16:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:16:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2022-12-06 05:16:02,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12544802867383512 [2022-12-06 05:16:02,335 INFO L175 Difference]: Start difference. First operand has 227 places, 1255 transitions, 30854 flow. Second operand 15 states and 175 transitions. [2022-12-06 05:16:02,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 1388 transitions, 36221 flow [2022-12-06 05:16:04,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 1388 transitions, 34627 flow, removed 749 selfloop flow, removed 10 redundant places. [2022-12-06 05:16:04,811 INFO L231 Difference]: Finished difference. Result has 239 places, 1334 transitions, 34223 flow [2022-12-06 05:16:04,812 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=29382, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=646, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=34223, PETRI_PLACES=239, PETRI_TRANSITIONS=1334} [2022-12-06 05:16:04,813 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 220 predicate places. [2022-12-06 05:16:04,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:04,813 INFO L89 Accepts]: Start accepts. Operand has 239 places, 1334 transitions, 34223 flow [2022-12-06 05:16:04,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:04,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:04,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 1334 transitions, 34223 flow [2022-12-06 05:16:04,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 1334 transitions, 34223 flow [2022-12-06 05:16:05,685 INFO L130 PetriNetUnfolder]: 1708/3707 cut-off events. [2022-12-06 05:16:05,685 INFO L131 PetriNetUnfolder]: For 122236/128735 co-relation queries the response was YES. [2022-12-06 05:16:05,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40074 conditions, 3707 events. 1708/3707 cut-off events. For 122236/128735 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 30063 event pairs, 20 based on Foata normal form. 3/3698 useless extension candidates. Maximal degree in co-relation 39881. Up to 1631 conditions per place. [2022-12-06 05:16:05,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 1334 transitions, 34223 flow [2022-12-06 05:16:05,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 2996 [2022-12-06 05:16:05,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] L40-1-->L51-1: Formula: (and (= v_~k1~0_319 (+ v_~k1~0_320 8)) (= (+ v_~k2~0_324 v_~m~0_249) v_~k2~0_323) (= 8 v_~j1~0_373) (= (+ v_~i2~0_324 1) v_~i2~0_323) (< v_~i2~0_324 v_~n~0_229) (< v_~i1~0_346 v_~n~0_229) (< 7 v_~m~0_249)) InVars {~m~0=v_~m~0_249, ~k2~0=v_~k2~0_324, ~k1~0=v_~k1~0_320, ~i2~0=v_~i2~0_324, ~i1~0=v_~i1~0_346, ~n~0=v_~n~0_229} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_169|, ~m~0=v_~m~0_249, ~k2~0=v_~k2~0_323, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_169|, ~k1~0=v_~k1~0_319, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_171|, ~i2~0=v_~i2~0_323, ~j1~0=v_~j1~0_373, ~i1~0=v_~i1~0_346, ~n~0=v_~n~0_229} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] [2022-12-06 05:16:06,015 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] L40-1-->L51-1: Formula: (and (= v_~k1~0_319 (+ v_~k1~0_320 8)) (= (+ v_~k2~0_324 v_~m~0_249) v_~k2~0_323) (= 8 v_~j1~0_373) (= (+ v_~i2~0_324 1) v_~i2~0_323) (< v_~i2~0_324 v_~n~0_229) (< v_~i1~0_346 v_~n~0_229) (< 7 v_~m~0_249)) InVars {~m~0=v_~m~0_249, ~k2~0=v_~k2~0_324, ~k1~0=v_~k1~0_320, ~i2~0=v_~i2~0_324, ~i1~0=v_~i1~0_346, ~n~0=v_~n~0_229} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_169|, ~m~0=v_~m~0_249, ~k2~0=v_~k2~0_323, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_169|, ~k1~0=v_~k1~0_319, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_171|, ~i2~0=v_~i2~0_323, ~j1~0=v_~j1~0_373, ~i1~0=v_~i1~0_346, ~n~0=v_~n~0_229} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-06 05:16:06,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [514] L40-1-->L40-1: Formula: (and (< v_~i2~0_385 v_~n~0_273) (= v_~k1~0_433 (+ v_~k1~0_434 8)) (= v_~i2~0_384 (+ v_~i2~0_385 1)) (= v_~i1~0_407 (+ v_~i1~0_408 1)) (= 8 v_~j1~0_470) (< 7 v_~m~0_299) (= (+ v_~k2~0_386 v_~m~0_299) v_~k2~0_385) (< v_~i1~0_408 v_~n~0_273) (not (< v_~j1~0_470 v_~m~0_299))) InVars {~m~0=v_~m~0_299, ~k2~0=v_~k2~0_386, ~k1~0=v_~k1~0_434, ~i2~0=v_~i2~0_385, ~i1~0=v_~i1~0_408, ~n~0=v_~n~0_273} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_203|, ~m~0=v_~m~0_299, ~k2~0=v_~k2~0_385, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_236|, ~k1~0=v_~k1~0_433, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_238|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_167|, ~j1~0=v_~j1~0_470, ~i2~0=v_~i2~0_384, ~i1~0=v_~i1~0_407, ~n~0=v_~n~0_273} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i2~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:16:06,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:16:06,543 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:16:06,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1730 [2022-12-06 05:16:06,543 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 1334 transitions, 34372 flow [2022-12-06 05:16:06,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:06,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:06,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:06,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 05:16:06,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:16:06,748 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:16:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1610018138, now seen corresponding path program 1 times [2022-12-06 05:16:06,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:06,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256890323] [2022-12-06 05:16:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:06,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:06,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256890323] [2022-12-06 05:16:06,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256890323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:06,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:06,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:06,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522198934] [2022-12-06 05:16:06,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:06,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:06,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:06,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:06,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:06,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 97 [2022-12-06 05:16:06,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 1334 transitions, 34372 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 05:16:06,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:06,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 97 [2022-12-06 05:16:06,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:09,986 INFO L130 PetriNetUnfolder]: 4815/8164 cut-off events. [2022-12-06 05:16:09,987 INFO L131 PetriNetUnfolder]: For 241590/241590 co-relation queries the response was YES. [2022-12-06 05:16:10,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87688 conditions, 8164 events. 4815/8164 cut-off events. For 241590/241590 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 56471 event pairs, 404 based on Foata normal form. 106/8236 useless extension candidates. Maximal degree in co-relation 87355. Up to 3837 conditions per place. [2022-12-06 05:16:10,168 INFO L137 encePairwiseOnDemand]: 43/97 looper letters, 1010 selfloop transitions, 489 changer transitions 10/1509 dead transitions. [2022-12-06 05:16:10,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 1509 transitions, 40386 flow [2022-12-06 05:16:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:16:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:16:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-12-06 05:16:10,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18556701030927836 [2022-12-06 05:16:10,171 INFO L175 Difference]: Start difference. First operand has 233 places, 1334 transitions, 34372 flow. Second operand 7 states and 126 transitions. [2022-12-06 05:16:10,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 1509 transitions, 40386 flow [2022-12-06 05:16:12,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 1509 transitions, 39653 flow, removed 314 selfloop flow, removed 6 redundant places. [2022-12-06 05:16:12,381 INFO L231 Difference]: Finished difference. Result has 237 places, 1306 transitions, 34938 flow [2022-12-06 05:16:12,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=31955, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=452, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=34938, PETRI_PLACES=237, PETRI_TRANSITIONS=1306} [2022-12-06 05:16:12,382 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 218 predicate places. [2022-12-06 05:16:12,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:12,382 INFO L89 Accepts]: Start accepts. Operand has 237 places, 1306 transitions, 34938 flow [2022-12-06 05:16:12,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:12,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:12,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 1306 transitions, 34938 flow [2022-12-06 05:16:12,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 1306 transitions, 34938 flow [2022-12-06 05:16:13,109 INFO L130 PetriNetUnfolder]: 1606/3080 cut-off events. [2022-12-06 05:16:13,109 INFO L131 PetriNetUnfolder]: For 126388/134384 co-relation queries the response was YES. [2022-12-06 05:16:13,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37053 conditions, 3080 events. 1606/3080 cut-off events. For 126388/134384 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 21076 event pairs, 12 based on Foata normal form. 4/3071 useless extension candidates. Maximal degree in co-relation 36854. Up to 1552 conditions per place. [2022-12-06 05:16:13,163 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 1306 transitions, 34938 flow [2022-12-06 05:16:13,164 INFO L188 LiptonReduction]: Number of co-enabled transitions 2944 [2022-12-06 05:16:13,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L51-1-->L41-6: Formula: (and (= v_~j1~0_114 0) (= (+ v_~m~0_95 v_~k2~0_100) v_~k2~0_99) (< v_~i1~0_116 v_~n~0_85) (< v_~i2~0_99 v_~n~0_85) (= v_~i2~0_98 (+ v_~i2~0_99 1))) InVars {~m~0=v_~m~0_95, ~k2~0=v_~k2~0_100, ~i2~0=v_~i2~0_99, ~i1~0=v_~i1~0_116, ~n~0=v_~n~0_85} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_39|, ~m~0=v_~m~0_95, ~k2~0=v_~k2~0_99, ~j1~0=v_~j1~0_114, ~i2~0=v_~i2~0_98, ~i1~0=v_~i1~0_116, ~n~0=v_~n~0_85} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~j1~0, ~i2~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:16:13,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] L41-6-->L41-6: Formula: (and (< v_~i1~0_238 v_~n~0_169) (= (+ v_~i1~0_239 1) v_~i1~0_238) (not (< v_~j1~0_262 v_~m~0_183)) (= v_~j1~0_261 0)) InVars {~m~0=v_~m~0_183, ~j1~0=v_~j1~0_262, ~i1~0=v_~i1~0_239, ~n~0=v_~n~0_169} OutVars{~m~0=v_~m~0_183, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_95|, ~j1~0=v_~j1~0_261, ~i1~0=v_~i1~0_238, ~n~0=v_~n~0_169} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:16:13,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:16:13,680 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L41-6-->L41-6: Formula: (and (= v_~i1~0_199 (+ v_~i1~0_200 1)) (< v_~i1~0_199 v_~n~0_143) (= v_~j1~0_207 0) (not (< v_~j1~0_208 v_~m~0_155))) InVars {~m~0=v_~m~0_155, ~j1~0=v_~j1~0_208, ~i1~0=v_~i1~0_200, ~n~0=v_~n~0_143} OutVars{~m~0=v_~m~0_155, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_79|, ~j1~0=v_~j1~0_207, ~i1~0=v_~i1~0_199, ~n~0=v_~n~0_143} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:16:13,782 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] L41-6-->L41-6: Formula: (and (< v_~i1~0_314 v_~n~0_213) (= v_~j1~0_349 0) (not (< v_~j1~0_350 v_~m~0_233)) (= (+ v_~i1~0_315 1) v_~i1~0_314)) InVars {~m~0=v_~m~0_233, ~j1~0=v_~j1~0_350, ~i1~0=v_~i1~0_315, ~n~0=v_~n~0_213} OutVars{~m~0=v_~m~0_233, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_131|, ~j1~0=v_~j1~0_349, ~i1~0=v_~i1~0_314, ~n~0=v_~n~0_213} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 05:16:13,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:16:13,835 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 15 out of bounds for length 15 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) 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 05:16:13,838 INFO L158 Benchmark]: Toolchain (without parser) took 99025.99ms. Allocated memory was 173.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 149.1MB in the beginning and 889.5MB in the end (delta: -740.4MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-06 05:16:13,838 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 173.0MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:16:13,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.99ms. Allocated memory is still 173.0MB. Free memory was 148.6MB in the beginning and 137.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 05:16:13,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.86ms. Allocated memory is still 173.0MB. Free memory was 137.7MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:16:13,838 INFO L158 Benchmark]: Boogie Preprocessor took 34.40ms. Allocated memory is still 173.0MB. Free memory was 136.0MB in the beginning and 134.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:16:13,838 INFO L158 Benchmark]: RCFGBuilder took 310.17ms. Allocated memory is still 173.0MB. Free memory was 134.6MB in the beginning and 121.4MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:16:13,838 INFO L158 Benchmark]: TraceAbstraction took 98403.92ms. Allocated memory was 173.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 120.8MB in the beginning and 889.5MB in the end (delta: -768.7MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-06 05:16:13,839 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.12ms. Allocated memory is still 173.0MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.99ms. Allocated memory is still 173.0MB. Free memory was 148.6MB in the beginning and 137.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.86ms. Allocated memory is still 173.0MB. Free memory was 137.7MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.40ms. Allocated memory is still 173.0MB. Free memory was 136.0MB in the beginning and 134.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 310.17ms. Allocated memory is still 173.0MB. Free memory was 134.6MB in the beginning and 121.4MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 98403.92ms. Allocated memory was 173.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 120.8MB in the beginning and 889.5MB in the end (delta: -768.7MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 100 PlacesBefore, 19 PlacesAfterwards, 102 TransitionsBefore, 15 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 25 ConcurrentYvCompositions, 6 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 395, independent: 395, independent conditional: 395, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 395, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 395, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 395, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 395, independent: 395, independent conditional: 0, independent unconditional: 395, 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: 395, independent: 395, independent conditional: 0, independent unconditional: 395, 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: 395, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 395, unknown conditional: 0, unknown unconditional: 395] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 669, Positive conditional cache size: 0, Positive unconditional cache size: 669, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 18 PlacesBefore, 18 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 24 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 2, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 2, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 2, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 2, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 66 PlacesBefore, 64 PlacesAfterwards, 109 TransitionsBefore, 107 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 25, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 17, Positive conditional cache size: 11, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 82 PlacesBefore, 81 PlacesAfterwards, 259 TransitionsBefore, 258 TransitionsAfterwards, 658 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 16, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 266 TransitionsBefore, 266 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 16, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 111 PlacesBefore, 110 PlacesAfterwards, 332 TransitionsBefore, 331 TransitionsAfterwards, 838 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 34, independent conditional: 25, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 25, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 13, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 34, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 13, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 52, Positive conditional cache size: 37, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 117 PlacesBefore, 117 PlacesAfterwards, 395 TransitionsBefore, 395 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 60, Positive conditional cache size: 45, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 117 PlacesBefore, 117 PlacesAfterwards, 382 TransitionsBefore, 382 TransitionsAfterwards, 924 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 60, Positive conditional cache size: 45, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 136 PlacesBefore, 135 PlacesAfterwards, 421 TransitionsBefore, 420 TransitionsAfterwards, 1026 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 31, independent conditional: 25, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 25, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 31, independent: 23, independent conditional: 17, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 81, Positive conditional cache size: 63, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 148 PlacesBefore, 148 PlacesAfterwards, 712 TransitionsBefore, 712 TransitionsAfterwards, 1604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 81, Positive conditional cache size: 63, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 172 PlacesBefore, 171 PlacesAfterwards, 782 TransitionsBefore, 781 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 12, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 88, Positive conditional cache size: 68, Positive unconditional cache size: 20, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 177 PlacesBefore, 177 PlacesAfterwards, 787 TransitionsBefore, 787 TransitionsAfterwards, 1816 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 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: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 130, Positive conditional cache size: 107, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 180 PlacesBefore, 180 PlacesAfterwards, 943 TransitionsBefore, 943 TransitionsAfterwards, 2128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 130, Positive conditional cache size: 107, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 201 PlacesBefore, 200 PlacesAfterwards, 1072 TransitionsBefore, 1071 TransitionsAfterwards, 2400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 12, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 12, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 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: 21, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 137, Positive conditional cache size: 110, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 230 PlacesBefore, 227 PlacesAfterwards, 1259 TransitionsBefore, 1255 TransitionsAfterwards, 2850 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 88, independent conditional: 76, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 88, independent conditional: 76, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 88, independent: 70, independent conditional: 58, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 199, Positive conditional cache size: 165, Positive unconditional cache size: 34, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 233 PlacesBefore, 233 PlacesAfterwards, 1334 TransitionsBefore, 1334 TransitionsAfterwards, 2996 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 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: 8, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 205, Positive conditional cache size: 170, Positive unconditional cache size: 35, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 15 out of bounds for length 15 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 15 out of bounds for length 15: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:16:13,900 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...