/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/clever.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:35:33,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:35:33,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:35:33,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:35:33,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:35:33,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:35:33,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:35:33,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:35:33,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:35:33,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:35:33,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:35:33,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:35:33,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:35:33,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:35:33,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:35:33,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:35:33,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:35:33,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:35:33,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:35:33,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:35:33,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:35:33,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:35:33,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:35:33,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:35:33,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:35:33,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:35:33,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:35:33,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:35:33,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:35:33,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:35:33,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:35:33,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:35:33,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:35:33,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:35:33,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:35:33,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:35:33,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:35:33,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:35:33,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:35:33,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:35:33,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:35:33,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 01:35:33,858 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:35:33,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:35:33,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:35:33,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:35:33,861 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:35:33,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:35:33,862 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:35:33,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:35:33,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:35:33,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:35:33,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:35:33,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:35:33,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:35:33,863 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:35:33,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:35:33,864 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:35:33,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:35:33,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:35:33,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:35:33,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:35:33,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:35:33,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:35:33,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:35:33,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:35:33,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:35:33,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:35:33,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:35:33,865 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:35:33,865 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-13 01:35:34,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:35:34,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:35:34,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:35:34,176 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:35:34,177 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:35:34,181 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-13 01:35:35,402 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:35:35,612 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:35:35,612 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2022-12-13 01:35:35,619 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d14a1daa/08ad341668d04cd59bd7f35d5cd7e250/FLAG97fbdcd9b [2022-12-13 01:35:35,638 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d14a1daa/08ad341668d04cd59bd7f35d5cd7e250 [2022-12-13 01:35:35,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:35:35,641 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:35:35,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:35:35,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:35:35,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:35:35,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ef67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35, skipping insertion in model container [2022-12-13 01:35:35,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:35:35,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:35:35,801 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-13 01:35:35,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:35:35,813 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:35:35,841 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-13 01:35:35,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:35:35,854 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:35:35,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35 WrapperNode [2022-12-13 01:35:35,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:35:35,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:35:35,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:35:35,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:35:35,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,879 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2022-12-13 01:35:35,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:35:35,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:35:35,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:35:35,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:35:35,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,906 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:35:35,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:35:35,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:35:35,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:35:35,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (1/1) ... [2022-12-13 01:35:35,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:35:35,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:35:35,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 01:35:35,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 01:35:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:35:35,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:35:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:35:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:35:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:35:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:35:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:35:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:35:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:35:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:35:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:35:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:35:35,987 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:35:36,065 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:35:36,070 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:35:36,344 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:35:36,351 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:35:36,351 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 01:35:36,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:35:36 BoogieIcfgContainer [2022-12-13 01:35:36,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:35:36,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:35:36,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:35:36,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:35:36,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:35:35" (1/3) ... [2022-12-13 01:35:36,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7044b4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:35:36, skipping insertion in model container [2022-12-13 01:35:36,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:35" (2/3) ... [2022-12-13 01:35:36,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7044b4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:35:36, skipping insertion in model container [2022-12-13 01:35:36,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:35:36" (3/3) ... [2022-12-13 01:35:36,361 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2022-12-13 01:35:36,411 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:35:36,412 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:35:36,412 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:35:36,490 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 01:35:36,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 112 transitions, 240 flow [2022-12-13 01:35:36,570 INFO L130 PetriNetUnfolder]: 9/110 cut-off events. [2022-12-13 01:35:36,571 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:35:36,581 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-13 01:35:36,581 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 112 transitions, 240 flow [2022-12-13 01:35:36,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 102 transitions, 216 flow [2022-12-13 01:35:36,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:36,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 102 transitions, 216 flow [2022-12-13 01:35:36,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 102 transitions, 216 flow [2022-12-13 01:35:36,655 INFO L130 PetriNetUnfolder]: 9/102 cut-off events. [2022-12-13 01:35:36,656 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:35:36,658 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-13 01:35:36,661 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 102 transitions, 216 flow [2022-12-13 01:35:36,661 INFO L226 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-13 01:35:40,394 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 01:35:40,408 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:35:40,413 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;@5ff8925d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:35:40,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 01:35:40,418 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-13 01:35:40,418 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:35:40,418 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:40,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:35:40,419 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:35:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1941019273, now seen corresponding path program 1 times [2022-12-13 01:35:40,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:40,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316385623] [2022-12-13 01:35:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:40,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:40,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316385623] [2022-12-13 01:35:40,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316385623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:40,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:40,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 01:35:40,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529974208] [2022-12-13 01:35:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:40,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:35:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:40,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:35:40,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:35:40,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 01:35:40,906 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-13 01:35:40,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:40,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 01:35:40,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:41,004 INFO L130 PetriNetUnfolder]: 69/117 cut-off events. [2022-12-13 01:35:41,004 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-13 01:35:41,005 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-13 01:35:41,006 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-13 01:35:41,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 129 flow [2022-12-13 01:35:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:35:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:35:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-13 01:35:41,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2022-12-13 01:35:41,015 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 42 flow. Second operand 3 states and 28 transitions. [2022-12-13 01:35:41,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 129 flow [2022-12-13 01:35:41,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 27 transitions, 115 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 01:35:41,019 INFO L231 Difference]: Finished difference. Result has 18 places, 17 transitions, 53 flow [2022-12-13 01:35:41,020 INFO L277 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-13 01:35:41,023 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2022-12-13 01:35:41,023 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:41,024 INFO L89 Accepts]: Start accepts. Operand has 18 places, 17 transitions, 53 flow [2022-12-13 01:35:41,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:41,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:41,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 18 places, 17 transitions, 53 flow [2022-12-13 01:35:41,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 17 transitions, 53 flow [2022-12-13 01:35:41,031 INFO L130 PetriNetUnfolder]: 9/31 cut-off events. [2022-12-13 01:35:41,031 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:35:41,032 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-13 01:35:41,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 17 transitions, 53 flow [2022-12-13 01:35:41,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-13 01:35:41,034 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:35:41,036 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 01:35:41,036 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 17 transitions, 53 flow [2022-12-13 01:35:41,036 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-13 01:35:41,036 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:41,036 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:35:41,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:35:41,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:35:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:41,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1677528037, now seen corresponding path program 1 times [2022-12-13 01:35:41,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:41,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461864486] [2022-12-13 01:35:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:41,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:41,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:41,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461864486] [2022-12-13 01:35:41,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461864486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:41,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:41,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:35:41,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990240434] [2022-12-13 01:35:41,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:41,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:35:41,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:41,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:35:41,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:35:41,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 01:35:41,093 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-13 01:35:41,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:41,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 01:35:41,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:41,169 INFO L130 PetriNetUnfolder]: 125/216 cut-off events. [2022-12-13 01:35:41,169 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-13 01:35:41,170 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-13 01:35:41,171 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 40 selfloop transitions, 7 changer transitions 2/49 dead transitions. [2022-12-13 01:35:41,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 49 transitions, 242 flow [2022-12-13 01:35:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:35:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:35:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 01:35:41,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-13 01:35:41,173 INFO L175 Difference]: Start difference. First operand has 18 places, 17 transitions, 53 flow. Second operand 5 states and 44 transitions. [2022-12-13 01:35:41,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 49 transitions, 242 flow [2022-12-13 01:35:41,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 49 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:35:41,175 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 101 flow [2022-12-13 01:35:41,175 INFO L277 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-13 01:35:41,176 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 5 predicate places. [2022-12-13 01:35:41,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:41,176 INFO L89 Accepts]: Start accepts. Operand has 24 places, 23 transitions, 101 flow [2022-12-13 01:35:41,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:41,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:41,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 23 transitions, 101 flow [2022-12-13 01:35:41,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 23 transitions, 101 flow [2022-12-13 01:35:41,184 INFO L130 PetriNetUnfolder]: 29/79 cut-off events. [2022-12-13 01:35:41,184 INFO L131 PetriNetUnfolder]: For 23/36 co-relation queries the response was YES. [2022-12-13 01:35:41,185 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-13 01:35:41,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 23 transitions, 101 flow [2022-12-13 01:35:41,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-13 01:35:41,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L51-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (not (< v_~i2~0_In_1 v_~n~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, ~i2~0=v_~i2~0_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, ~i2~0=v_~i2~0_In_1, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} 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-13 01:35:41,282 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:35:41,284 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 01:35:41,285 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 105 flow [2022-12-13 01:35:41,285 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-13 01:35:41,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:41,285 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:35:41,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:35:41,286 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:35:41,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1006824449, now seen corresponding path program 2 times [2022-12-13 01:35:41,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:41,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086048189] [2022-12-13 01:35:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:41,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:41,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:41,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086048189] [2022-12-13 01:35:41,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086048189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:41,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:41,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:35:41,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443844467] [2022-12-13 01:35:41,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:41,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:35:41,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:35:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:35:41,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 01:35:41,379 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-13 01:35:41,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:41,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 01:35:41,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:41,457 INFO L130 PetriNetUnfolder]: 111/192 cut-off events. [2022-12-13 01:35:41,457 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-12-13 01:35:41,459 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-13 01:35:41,462 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 32 selfloop transitions, 10 changer transitions 6/48 dead transitions. [2022-12-13 01:35:41,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 48 transitions, 298 flow [2022-12-13 01:35:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:35:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:35:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 01:35:41,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-13 01:35:41,464 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 105 flow. Second operand 5 states and 40 transitions. [2022-12-13 01:35:41,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 48 transitions, 298 flow [2022-12-13 01:35:41,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 48 transitions, 294 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 01:35:41,468 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 154 flow [2022-12-13 01:35:41,469 INFO L277 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-13 01:35:41,470 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 11 predicate places. [2022-12-13 01:35:41,470 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:41,470 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 154 flow [2022-12-13 01:35:41,471 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:41,471 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:41,471 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 154 flow [2022-12-13 01:35:41,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 154 flow [2022-12-13 01:35:41,481 INFO L130 PetriNetUnfolder]: 31/74 cut-off events. [2022-12-13 01:35:41,482 INFO L131 PetriNetUnfolder]: For 69/77 co-relation queries the response was YES. [2022-12-13 01:35:41,482 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-13 01:35:41,483 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 154 flow [2022-12-13 01:35:41,483 INFO L226 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-13 01:35:41,485 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:35:41,487 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 01:35:41,487 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 154 flow [2022-12-13 01:35:41,487 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-13 01:35:41,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:41,488 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:35:41,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:35:41,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:35:41,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:41,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1476743439, now seen corresponding path program 1 times [2022-12-13 01:35:41,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:41,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514438038] [2022-12-13 01:35:41,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:41,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:35:41,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:41,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514438038] [2022-12-13 01:35:41,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514438038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:41,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:41,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:35:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175533793] [2022-12-13 01:35:41,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:41,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:35:41,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:41,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:35:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:35:41,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 01:35:41,554 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-13 01:35:41,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:41,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 01:35:41,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:41,619 INFO L130 PetriNetUnfolder]: 116/209 cut-off events. [2022-12-13 01:35:41,619 INFO L131 PetriNetUnfolder]: For 375/375 co-relation queries the response was YES. [2022-12-13 01:35:41,620 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-13 01:35:41,621 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 37 selfloop transitions, 6 changer transitions 6/49 dead transitions. [2022-12-13 01:35:41,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 49 transitions, 362 flow [2022-12-13 01:35:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:35:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:35:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 01:35:41,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-13 01:35:41,623 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 154 flow. Second operand 5 states and 40 transitions. [2022-12-13 01:35:41,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 49 transitions, 362 flow [2022-12-13 01:35:41,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 354 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 01:35:41,627 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 206 flow [2022-12-13 01:35:41,627 INFO L277 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-13 01:35:41,627 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 19 predicate places. [2022-12-13 01:35:41,628 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:41,628 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 206 flow [2022-12-13 01:35:41,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:41,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:41,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 206 flow [2022-12-13 01:35:41,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 206 flow [2022-12-13 01:35:41,635 INFO L130 PetriNetUnfolder]: 21/65 cut-off events. [2022-12-13 01:35:41,635 INFO L131 PetriNetUnfolder]: For 117/120 co-relation queries the response was YES. [2022-12-13 01:35:41,636 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-13 01:35:41,636 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 206 flow [2022-12-13 01:35:41,636 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 01:35:41,637 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:35:41,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 01:35:41,638 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 206 flow [2022-12-13 01:35:41,638 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-13 01:35:41,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:41,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:35:41,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:35:41,639 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:35:41,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash -617492605, now seen corresponding path program 2 times [2022-12-13 01:35:41,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:41,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028152821] [2022-12-13 01:35:41,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:41,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:41,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028152821] [2022-12-13 01:35:41,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028152821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:41,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:41,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:35:41,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457312646] [2022-12-13 01:35:41,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:41,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:35:41,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:41,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:35:41,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:35:41,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 01:35:41,682 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-13 01:35:41,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:41,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 01:35:41,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:41,740 INFO L130 PetriNetUnfolder]: 88/150 cut-off events. [2022-12-13 01:35:41,740 INFO L131 PetriNetUnfolder]: For 322/322 co-relation queries the response was YES. [2022-12-13 01:35:41,741 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-13 01:35:41,742 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 30 selfloop transitions, 5 changer transitions 5/40 dead transitions. [2022-12-13 01:35:41,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 327 flow [2022-12-13 01:35:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:35:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:35:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 01:35:41,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-13 01:35:41,744 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 206 flow. Second operand 4 states and 33 transitions. [2022-12-13 01:35:41,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 327 flow [2022-12-13 01:35:41,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 325 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 01:35:41,747 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 194 flow [2022-12-13 01:35:41,748 INFO L277 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-13 01:35:41,750 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 22 predicate places. [2022-12-13 01:35:41,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:41,750 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 194 flow [2022-12-13 01:35:41,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:41,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:41,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 194 flow [2022-12-13 01:35:41,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 194 flow [2022-12-13 01:35:41,757 INFO L130 PetriNetUnfolder]: 21/48 cut-off events. [2022-12-13 01:35:41,757 INFO L131 PetriNetUnfolder]: For 107/110 co-relation queries the response was YES. [2022-12-13 01:35:41,758 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-13 01:35:41,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 194 flow [2022-12-13 01:35:41,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 01:35:41,759 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:35:41,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 01:35:41,760 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 194 flow [2022-12-13 01:35:41,761 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-13 01:35:41,761 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:41,761 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:35:41,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:35:41,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:35:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1669050343, now seen corresponding path program 1 times [2022-12-13 01:35:41,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:41,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194850036] [2022-12-13 01:35:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:42,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:42,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194850036] [2022-12-13 01:35:42,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194850036] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:35:42,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359704040] [2022-12-13 01:35:42,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:42,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:35:42,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:35:42,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:35:42,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 01:35:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:42,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 01:35:42,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:35:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:46,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:35:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:48,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359704040] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:35:48,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:35:48,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 01:35:48,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075201483] [2022-12-13 01:35:48,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:35:48,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:35:48,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:48,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:35:48,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=111, Unknown=3, NotChecked=0, Total=156 [2022-12-13 01:35:48,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 01:35:48,870 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-13 01:35:48,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:48,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 01:35:48,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:50,779 INFO L130 PetriNetUnfolder]: 382/661 cut-off events. [2022-12-13 01:35:50,779 INFO L131 PetriNetUnfolder]: For 1303/1303 co-relation queries the response was YES. [2022-12-13 01:35:50,781 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-13 01:35:50,785 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 102 selfloop transitions, 69 changer transitions 49/220 dead transitions. [2022-12-13 01:35:50,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 220 transitions, 1850 flow [2022-12-13 01:35:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 01:35:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 01:35:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 188 transitions. [2022-12-13 01:35:50,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5820433436532507 [2022-12-13 01:35:50,787 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 194 flow. Second operand 19 states and 188 transitions. [2022-12-13 01:35:50,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 220 transitions, 1850 flow [2022-12-13 01:35:50,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 220 transitions, 1787 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-13 01:35:50,796 INFO L231 Difference]: Finished difference. Result has 66 places, 109 transitions, 1156 flow [2022-12-13 01:35:50,796 INFO L277 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-13 01:35:50,796 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 47 predicate places. [2022-12-13 01:35:50,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:50,797 INFO L89 Accepts]: Start accepts. Operand has 66 places, 109 transitions, 1156 flow [2022-12-13 01:35:50,798 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:50,798 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:50,798 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 109 transitions, 1156 flow [2022-12-13 01:35:50,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 109 transitions, 1156 flow [2022-12-13 01:35:50,823 INFO L130 PetriNetUnfolder]: 111/253 cut-off events. [2022-12-13 01:35:50,823 INFO L131 PetriNetUnfolder]: For 920/925 co-relation queries the response was YES. [2022-12-13 01:35:50,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 253 events. 111/253 cut-off events. For 920/925 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1093 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-13 01:35:50,826 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 109 transitions, 1156 flow [2022-12-13 01:35:50,826 INFO L226 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-13 01:35:50,933 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-13 01:35:50,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:35:51,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:35:51,190 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-13 01:35:51,366 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_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-13 01:35:51,529 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-13 01:35:51,666 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 01:35:51,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 870 [2022-12-13 01:35:51,667 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 107 transitions, 1216 flow [2022-12-13 01:35:51,667 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-13 01:35:51,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:51,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:35:51,678 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-13 01:35:51,873 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-13 01:35:51,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:35:51,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1093522903, now seen corresponding path program 2 times [2022-12-13 01:35:51,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:51,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110852219] [2022-12-13 01:35:51,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:51,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:52,244 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-13 01:35:52,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:52,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110852219] [2022-12-13 01:35:52,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110852219] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:35:52,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452095374] [2022-12-13 01:35:52,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:35:52,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:35:52,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:35:52,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:35:52,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 01:35:52,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:35:52,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:35:52,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 01:35:52,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:35:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:52,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:35:52,824 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-13 01:35:52,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452095374] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:35:52,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:35:52,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 01:35:52,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985467041] [2022-12-13 01:35:52,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:35:52,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:35:52,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:52,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:35:52,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-12-13 01:35:52,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 01:35:52,826 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-13 01:35:52,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:52,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 01:35:52,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:54,328 INFO L130 PetriNetUnfolder]: 977/1703 cut-off events. [2022-12-13 01:35:54,329 INFO L131 PetriNetUnfolder]: For 6540/6540 co-relation queries the response was YES. [2022-12-13 01:35:54,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8965 conditions, 1703 events. 977/1703 cut-off events. For 6540/6540 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9012 event pairs, 0 based on Foata normal form. 6/1709 useless extension candidates. Maximal degree in co-relation 7839. Up to 600 conditions per place. [2022-12-13 01:35:54,342 INFO L137 encePairwiseOnDemand]: 9/28 looper letters, 167 selfloop transitions, 181 changer transitions 30/378 dead transitions. [2022-12-13 01:35:54,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 378 transitions, 4575 flow [2022-12-13 01:35:54,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:35:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:35:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 150 transitions. [2022-12-13 01:35:54,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3826530612244898 [2022-12-13 01:35:54,345 INFO L175 Difference]: Start difference. First operand has 64 places, 107 transitions, 1216 flow. Second operand 14 states and 150 transitions. [2022-12-13 01:35:54,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 378 transitions, 4575 flow [2022-12-13 01:35:54,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 378 transitions, 4070 flow, removed 230 selfloop flow, removed 5 redundant places. [2022-12-13 01:35:54,392 INFO L231 Difference]: Finished difference. Result has 83 places, 259 transitions, 3282 flow [2022-12-13 01:35:54,392 INFO L277 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-13 01:35:54,393 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 64 predicate places. [2022-12-13 01:35:54,393 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:54,393 INFO L89 Accepts]: Start accepts. Operand has 83 places, 259 transitions, 3282 flow [2022-12-13 01:35:54,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:54,395 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:54,395 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 259 transitions, 3282 flow [2022-12-13 01:35:54,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 259 transitions, 3282 flow [2022-12-13 01:35:54,461 INFO L130 PetriNetUnfolder]: 297/689 cut-off events. [2022-12-13 01:35:54,461 INFO L131 PetriNetUnfolder]: For 4466/4533 co-relation queries the response was YES. [2022-12-13 01:35:54,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 689 events. 297/689 cut-off events. For 4466/4533 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4031 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-13 01:35:54,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 259 transitions, 3282 flow [2022-12-13 01:35:54,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 658 [2022-12-13 01:35:54,475 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-13 01:35:54,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] L40-1-->L41-6: Formula: (and (< v_~i1~0_99 v_~n~0_73) (= 2 v_~j1~0_97) (= v_~k1~0_87 (+ 2 v_~k1~0_89)) (< 1 v_~m~0_83)) InVars {~m~0=v_~m~0_83, ~k1~0=v_~k1~0_89, ~i1~0=v_~i1~0_99, ~n~0=v_~n~0_73} OutVars{~m~0=v_~m~0_83, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_24|, ~k1~0=v_~k1~0_87, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_26|, ~j1~0=v_~j1~0_97, ~i1~0=v_~i1~0_99, ~n~0=v_~n~0_73} 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-13 01:35:54,753 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:35:54,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 361 [2022-12-13 01:35:54,754 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 258 transitions, 3300 flow [2022-12-13 01:35:54,755 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-13 01:35:54,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:54,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:35:54,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 01:35:54,960 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-13 01:35:54,961 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:35:54,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:54,961 INFO L85 PathProgramCache]: Analyzing trace with hash 954088028, now seen corresponding path program 1 times [2022-12-13 01:35:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:54,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856869482] [2022-12-13 01:35:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:55,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856869482] [2022-12-13 01:35:55,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856869482] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:35:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507019917] [2022-12-13 01:35:55,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:55,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:35:55,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:35:55,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:35:55,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 01:35:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:55,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 01:35:55,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:35:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:55,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:35:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:35:55,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507019917] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 01:35:55,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 01:35:55,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 3] total 7 [2022-12-13 01:35:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086885720] [2022-12-13 01:35:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:55,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:35:55,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:55,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:35:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:35:55,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 01:35:55,878 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-13 01:35:55,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:55,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 01:35:55,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:56,229 INFO L130 PetriNetUnfolder]: 996/1731 cut-off events. [2022-12-13 01:35:56,230 INFO L131 PetriNetUnfolder]: For 10610/10610 co-relation queries the response was YES. [2022-12-13 01:35:56,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10466 conditions, 1731 events. 996/1731 cut-off events. For 10610/10610 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9200 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-13 01:35:56,254 INFO L137 encePairwiseOnDemand]: 12/32 looper letters, 253 selfloop transitions, 31 changer transitions 8/292 dead transitions. [2022-12-13 01:35:56,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 292 transitions, 4292 flow [2022-12-13 01:35:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:35:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:35:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 01:35:56,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-13 01:35:56,256 INFO L175 Difference]: Start difference. First operand has 81 places, 258 transitions, 3300 flow. Second operand 4 states and 52 transitions. [2022-12-13 01:35:56,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 292 transitions, 4292 flow [2022-12-13 01:35:56,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 292 transitions, 4147 flow, removed 58 selfloop flow, removed 5 redundant places. [2022-12-13 01:35:56,363 INFO L231 Difference]: Finished difference. Result has 81 places, 266 transitions, 3388 flow [2022-12-13 01:35:56,363 INFO L277 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-13 01:35:56,365 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 62 predicate places. [2022-12-13 01:35:56,365 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:56,365 INFO L89 Accepts]: Start accepts. Operand has 81 places, 266 transitions, 3388 flow [2022-12-13 01:35:56,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:56,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:56,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 266 transitions, 3388 flow [2022-12-13 01:35:56,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 266 transitions, 3388 flow [2022-12-13 01:35:56,445 INFO L130 PetriNetUnfolder]: 314/728 cut-off events. [2022-12-13 01:35:56,445 INFO L131 PetriNetUnfolder]: For 4404/4503 co-relation queries the response was YES. [2022-12-13 01:35:56,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 728 events. 314/728 cut-off events. For 4404/4503 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4318 event pairs, 2 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 3882. Up to 259 conditions per place. [2022-12-13 01:35:56,454 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 266 transitions, 3388 flow [2022-12-13 01:35:56,454 INFO L226 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-13 01:35:56,455 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:35:56,456 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 01:35:56,456 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 266 transitions, 3388 flow [2022-12-13 01:35:56,456 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-13 01:35:56,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:56,457 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:35:56,462 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-13 01:35:56,661 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-13 01:35:56,662 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:35:56,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash -477120417, now seen corresponding path program 1 times [2022-12-13 01:35:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:56,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985871619] [2022-12-13 01:35:56,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:56,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:56,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985871619] [2022-12-13 01:35:56,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985871619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:35:56,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276451019] [2022-12-13 01:35:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:56,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:35:56,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:35:56,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:35:56,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 01:35:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:57,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 01:35:57,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:35:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:35:57,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:35:59,695 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-13 01:35:59,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276451019] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:35:59,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:35:59,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 01:35:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819451170] [2022-12-13 01:35:59,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:35:59,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:35:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:35:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=108, Unknown=1, NotChecked=0, Total=156 [2022-12-13 01:35:59,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 01:35:59,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 266 transitions, 3388 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-13 01:35:59,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:59,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 01:35:59,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:02,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:36:03,901 INFO L130 PetriNetUnfolder]: 1208/2108 cut-off events. [2022-12-13 01:36:03,901 INFO L131 PetriNetUnfolder]: For 12096/12096 co-relation queries the response was YES. [2022-12-13 01:36:03,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12641 conditions, 2108 events. 1208/2108 cut-off events. For 12096/12096 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11836 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-13 01:36:03,921 INFO L137 encePairwiseOnDemand]: 9/32 looper letters, 295 selfloop transitions, 94 changer transitions 50/439 dead transitions. [2022-12-13 01:36:03,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 439 transitions, 5931 flow [2022-12-13 01:36:03,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 01:36:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 01:36:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 192 transitions. [2022-12-13 01:36:03,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 01:36:03,924 INFO L175 Difference]: Start difference. First operand has 80 places, 266 transitions, 3388 flow. Second operand 20 states and 192 transitions. [2022-12-13 01:36:03,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 439 transitions, 5931 flow [2022-12-13 01:36:04,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 439 transitions, 5895 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-13 01:36:04,017 INFO L231 Difference]: Finished difference. Result has 111 places, 332 transitions, 4596 flow [2022-12-13 01:36:04,018 INFO L277 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-13 01:36:04,018 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 92 predicate places. [2022-12-13 01:36:04,018 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:04,019 INFO L89 Accepts]: Start accepts. Operand has 111 places, 332 transitions, 4596 flow [2022-12-13 01:36:04,023 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:04,023 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:04,023 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 332 transitions, 4596 flow [2022-12-13 01:36:04,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 332 transitions, 4596 flow [2022-12-13 01:36:04,119 INFO L130 PetriNetUnfolder]: 378/887 cut-off events. [2022-12-13 01:36:04,119 INFO L131 PetriNetUnfolder]: For 7800/7848 co-relation queries the response was YES. [2022-12-13 01:36:04,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5210 conditions, 887 events. 378/887 cut-off events. For 7800/7848 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5680 event pairs, 1 based on Foata normal form. 2/886 useless extension candidates. Maximal degree in co-relation 5051. Up to 316 conditions per place. [2022-12-13 01:36:04,130 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 332 transitions, 4596 flow [2022-12-13 01:36:04,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-13 01:36:04,256 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-13 01:36:04,304 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-13 01:36:04,567 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-13 01:36:04,654 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-13 01:36:04,690 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_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-13 01:36:04,878 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L51-1-->L40-1: Formula: (and (not (< v_~j1~0_152 v_~m~0_121)) (= (+ v_~i1~0_143 1) v_~i1~0_142) (< v_~i2~0_133 v_~n~0_109) (= (+ v_~i2~0_133 1) v_~i2~0_132) (= (+ v_~k2~0_136 v_~m~0_121) v_~k2~0_135)) InVars {~m~0=v_~m~0_121, ~k2~0=v_~k2~0_136, ~j1~0=v_~j1~0_152, ~i2~0=v_~i2~0_133, ~i1~0=v_~i1~0_143, ~n~0=v_~n~0_109} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_61|, ~m~0=v_~m~0_121, ~k2~0=v_~k2~0_135, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_55|, ~j1~0=v_~j1~0_152, ~i2~0=v_~i2~0_132, ~i1~0=v_~i1~0_142, ~n~0=v_~n~0_109} 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-13 01:36:05,027 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L51-1-->L40-1: Formula: (and (not (< v_~j1~0_152 v_~m~0_121)) (= (+ v_~i1~0_143 1) v_~i1~0_142) (< v_~i2~0_133 v_~n~0_109) (= (+ v_~i2~0_133 1) v_~i2~0_132) (= (+ v_~k2~0_136 v_~m~0_121) v_~k2~0_135)) InVars {~m~0=v_~m~0_121, ~k2~0=v_~k2~0_136, ~j1~0=v_~j1~0_152, ~i2~0=v_~i2~0_133, ~i1~0=v_~i1~0_143, ~n~0=v_~n~0_109} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_61|, ~m~0=v_~m~0_121, ~k2~0=v_~k2~0_135, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_55|, ~j1~0=v_~j1~0_152, ~i2~0=v_~i2~0_132, ~i1~0=v_~i1~0_142, ~n~0=v_~n~0_109} 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-13 01:36:05,116 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 01:36:05,117 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1099 [2022-12-13 01:36:05,117 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 331 transitions, 4763 flow [2022-12-13 01:36:05,118 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-13 01:36:05,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:05,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:05,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 01:36:05,325 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-13 01:36:05,326 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:36:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:05,326 INFO L85 PathProgramCache]: Analyzing trace with hash -29782694, now seen corresponding path program 1 times [2022-12-13 01:36:05,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:05,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983270546] [2022-12-13 01:36:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:05,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:05,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983270546] [2022-12-13 01:36:05,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983270546] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:36:05,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353269380] [2022-12-13 01:36:05,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:05,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:36:05,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:36:05,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:36:05,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 01:36:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:05,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:36:05,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:36:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:05,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:36:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:05,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353269380] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:36:05,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:36:05,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 01:36:05,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028892303] [2022-12-13 01:36:05,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:36:05,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:36:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:05,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:36:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:36:05,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:36:05,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 331 transitions, 4763 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-13 01:36:05,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:05,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:36:05,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:06,487 INFO L130 PetriNetUnfolder]: 2273/3812 cut-off events. [2022-12-13 01:36:06,487 INFO L131 PetriNetUnfolder]: For 32322/32322 co-relation queries the response was YES. [2022-12-13 01:36:06,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25158 conditions, 3812 events. 2273/3812 cut-off events. For 32322/32322 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 22825 event pairs, 4 based on Foata normal form. 110/3906 useless extension candidates. Maximal degree in co-relation 24961. Up to 1362 conditions per place. [2022-12-13 01:36:06,528 INFO L137 encePairwiseOnDemand]: 12/48 looper letters, 437 selfloop transitions, 424 changer transitions 6/867 dead transitions. [2022-12-13 01:36:06,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 867 transitions, 13303 flow [2022-12-13 01:36:06,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:36:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:36:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 131 transitions. [2022-12-13 01:36:06,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1949404761904762 [2022-12-13 01:36:06,530 INFO L175 Difference]: Start difference. First operand has 110 places, 331 transitions, 4763 flow. Second operand 14 states and 131 transitions. [2022-12-13 01:36:06,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 867 transitions, 13303 flow [2022-12-13 01:36:06,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 867 transitions, 12600 flow, removed 335 selfloop flow, removed 5 redundant places. [2022-12-13 01:36:06,884 INFO L231 Difference]: Finished difference. Result has 127 places, 616 transitions, 10167 flow [2022-12-13 01:36:06,884 INFO L277 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=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10167, PETRI_PLACES=127, PETRI_TRANSITIONS=616} [2022-12-13 01:36:06,884 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 108 predicate places. [2022-12-13 01:36:06,884 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:06,884 INFO L89 Accepts]: Start accepts. Operand has 127 places, 616 transitions, 10167 flow [2022-12-13 01:36:06,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:06,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:06,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 616 transitions, 10167 flow [2022-12-13 01:36:06,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 616 transitions, 10167 flow [2022-12-13 01:36:07,114 INFO L130 PetriNetUnfolder]: 773/1637 cut-off events. [2022-12-13 01:36:07,115 INFO L131 PetriNetUnfolder]: For 22560/23828 co-relation queries the response was YES. [2022-12-13 01:36:07,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11862 conditions, 1637 events. 773/1637 cut-off events. For 22560/23828 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11057 event pairs, 2 based on Foata normal form. 0/1631 useless extension candidates. Maximal degree in co-relation 11539. Up to 640 conditions per place. [2022-12-13 01:36:07,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 616 transitions, 10167 flow [2022-12-13 01:36:07,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 1396 [2022-12-13 01:36:07,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L40-1-->L41-6: Formula: (and (= v_~j1~0_142 4) (< v_~j1~0_142 (+ v_~m~0_113 1)) (< v_~i1~0_138 v_~n~0_101) (= (+ v_~k1~0_137 4) v_~k1~0_135)) InVars {~m~0=v_~m~0_113, ~k1~0=v_~k1~0_137, ~i1~0=v_~i1~0_138, ~n~0=v_~n~0_101} OutVars{~m~0=v_~m~0_113, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_55|, ~k1~0=v_~k1~0_135, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_57|, ~j1~0=v_~j1~0_142, ~i1~0=v_~i1~0_138, ~n~0=v_~n~0_101} 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-13 01:36:07,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L40-1-->L41-6: Formula: (and (= v_~k1~0_105 (+ v_~k1~0_107 3)) (= 3 v_~j1~0_110) (< 2 v_~m~0_95) (< v_~i1~0_114 v_~n~0_85)) InVars {~m~0=v_~m~0_95, ~k1~0=v_~k1~0_107, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_85} OutVars{~m~0=v_~m~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_35|, ~k1~0=v_~k1~0_105, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_37|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_85} 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-13 01:36:07,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L40-1-->L41-6: Formula: (and (= v_~k1~0_105 (+ v_~k1~0_107 3)) (= 3 v_~j1~0_110) (< 2 v_~m~0_95) (< v_~i1~0_114 v_~n~0_85)) InVars {~m~0=v_~m~0_95, ~k1~0=v_~k1~0_107, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_85} OutVars{~m~0=v_~m~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_35|, ~k1~0=v_~k1~0_105, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_37|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_85} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [424] L51-1-->L41-6: Formula: (and (= v_~k1~0_141 (+ v_~k1~0_142 1)) (= (+ v_~i2~0_129 1) v_~i2~0_128) (< v_~j1~0_149 v_~m~0_119) (< v_~i2~0_129 v_~n~0_107) (= (+ v_~j1~0_149 1) v_~j1~0_148) (= (+ v_~k2~0_132 v_~m~0_119) v_~k2~0_131)) InVars {~m~0=v_~m~0_119, ~k1~0=v_~k1~0_142, ~k2~0=v_~k2~0_132, ~j1~0=v_~j1~0_149, ~i2~0=v_~i2~0_129, ~n~0=v_~n~0_107} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_59|, ~m~0=v_~m~0_119, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_59|, ~k1~0=v_~k1~0_141, ~k2~0=v_~k2~0_131, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_61|, ~j1~0=v_~j1~0_148, ~i2~0=v_~i2~0_128, ~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-13 01:36:07,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L40-1-->L41-6: Formula: (and (= v_~k1~0_105 (+ v_~k1~0_107 3)) (= 3 v_~j1~0_110) (< 2 v_~m~0_95) (< v_~i1~0_114 v_~n~0_85)) InVars {~m~0=v_~m~0_95, ~k1~0=v_~k1~0_107, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_85} OutVars{~m~0=v_~m~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_35|, ~k1~0=v_~k1~0_105, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_37|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_85} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [423] L51-1-->L51-1: Formula: (and (= v_~i2~0_122 (+ 2 v_~i2~0_124)) (= (+ v_~k2~0_127 (* 2 v_~m~0_117)) v_~k2~0_125) (< (+ v_~i2~0_124 1) v_~n~0_105)) InVars {~m~0=v_~m~0_117, ~k2~0=v_~k2~0_127, ~i2~0=v_~i2~0_124, ~n~0=v_~n~0_105} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_55|, ~m~0=v_~m~0_117, ~k2~0=v_~k2~0_125, ~i2~0=v_~i2~0_122, ~n~0=v_~n~0_105} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-13 01:36:07,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L40-1-->L41-6: Formula: (and (= v_~k1~0_105 (+ v_~k1~0_107 3)) (= 3 v_~j1~0_110) (< 2 v_~m~0_95) (< v_~i1~0_114 v_~n~0_85)) InVars {~m~0=v_~m~0_95, ~k1~0=v_~k1~0_107, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_85} OutVars{~m~0=v_~m~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_35|, ~k1~0=v_~k1~0_105, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_37|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_85} 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-13 01:36:07,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L40-1-->L41-6: Formula: (and (= v_~k1~0_105 (+ v_~k1~0_107 3)) (= 3 v_~j1~0_110) (< 2 v_~m~0_95) (< v_~i1~0_114 v_~n~0_85)) InVars {~m~0=v_~m~0_95, ~k1~0=v_~k1~0_107, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_85} OutVars{~m~0=v_~m~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_35|, ~k1~0=v_~k1~0_105, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_37|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_85} 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-13 01:36:07,586 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:36:07,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 703 [2022-12-13 01:36:07,587 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 616 transitions, 10205 flow [2022-12-13 01:36:07,587 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-13 01:36:07,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:07,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:07,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 01:36:07,794 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-13 01:36:07,794 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:36:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:07,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2051854233, now seen corresponding path program 1 times [2022-12-13 01:36:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:07,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554715589] [2022-12-13 01:36:07,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:07,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:08,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:08,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554715589] [2022-12-13 01:36:08,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554715589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:36:08,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124020282] [2022-12-13 01:36:08,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:08,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:36:08,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:36:08,073 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:36:08,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 01:36:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:08,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 01:36:08,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:36:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:08,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:36:09,114 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-13 01:36:09,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124020282] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:36:09,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:36:09,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-13 01:36:09,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418778054] [2022-12-13 01:36:09,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:36:09,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:36:09,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:09,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:36:09,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:36:09,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:36:09,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 616 transitions, 10205 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-13 01:36:09,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:09,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:36:09,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:11,531 INFO L130 PetriNetUnfolder]: 2573/4362 cut-off events. [2022-12-13 01:36:11,531 INFO L131 PetriNetUnfolder]: For 53362/53362 co-relation queries the response was YES. [2022-12-13 01:36:11,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33291 conditions, 4362 events. 2573/4362 cut-off events. For 53362/53362 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 27301 event pairs, 12 based on Foata normal form. 10/4356 useless extension candidates. Maximal degree in co-relation 32716. Up to 3526 conditions per place. [2022-12-13 01:36:11,572 INFO L137 encePairwiseOnDemand]: 9/48 looper letters, 616 selfloop transitions, 172 changer transitions 59/847 dead transitions. [2022-12-13 01:36:11,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 847 transitions, 15149 flow [2022-12-13 01:36:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 01:36:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 01:36:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 221 transitions. [2022-12-13 01:36:11,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23020833333333332 [2022-12-13 01:36:11,574 INFO L175 Difference]: Start difference. First operand has 125 places, 616 transitions, 10205 flow. Second operand 20 states and 221 transitions. [2022-12-13 01:36:11,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 847 transitions, 15149 flow [2022-12-13 01:36:12,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 847 transitions, 14348 flow, removed 390 selfloop flow, removed 1 redundant places. [2022-12-13 01:36:12,041 INFO L231 Difference]: Finished difference. Result has 154 places, 705 transitions, 11764 flow [2022-12-13 01:36:12,041 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9644, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=11764, PETRI_PLACES=154, PETRI_TRANSITIONS=705} [2022-12-13 01:36:12,042 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 135 predicate places. [2022-12-13 01:36:12,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:12,042 INFO L89 Accepts]: Start accepts. Operand has 154 places, 705 transitions, 11764 flow [2022-12-13 01:36:12,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:12,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:12,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 705 transitions, 11764 flow [2022-12-13 01:36:12,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 705 transitions, 11764 flow [2022-12-13 01:36:12,292 INFO L130 PetriNetUnfolder]: 867/1883 cut-off events. [2022-12-13 01:36:12,292 INFO L131 PetriNetUnfolder]: For 25714/26972 co-relation queries the response was YES. [2022-12-13 01:36:12,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13601 conditions, 1883 events. 867/1883 cut-off events. For 25714/26972 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13475 event pairs, 4 based on Foata normal form. 4/1880 useless extension candidates. Maximal degree in co-relation 13285. Up to 733 conditions per place. [2022-12-13 01:36:12,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 705 transitions, 11764 flow [2022-12-13 01:36:12,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 1614 [2022-12-13 01:36:12,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L40-1-->L41-6: Formula: (and (< 4 v_~m~0_111) (= 5 v_~j1~0_138) (< v_~i1~0_136 v_~n~0_99) (= (+ v_~k1~0_131 5) v_~k1~0_129)) InVars {~m~0=v_~m~0_111, ~k1~0=v_~k1~0_131, ~i1~0=v_~i1~0_136, ~n~0=v_~n~0_99} OutVars{~m~0=v_~m~0_111, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_51|, ~k1~0=v_~k1~0_129, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_53|, ~j1~0=v_~j1~0_138, ~i1~0=v_~i1~0_136, ~n~0=v_~n~0_99} 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-13 01:36:12,458 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-13 01:36:12,532 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:36:12,605 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:36:12,698 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:36:12,699 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 657 [2022-12-13 01:36:12,699 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 704 transitions, 11844 flow [2022-12-13 01:36:12,699 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-13 01:36:12,699 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:12,699 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:12,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 01:36:12,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:36:12,904 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:36:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash -103742838, now seen corresponding path program 1 times [2022-12-13 01:36:12,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:12,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076863278] [2022-12-13 01:36:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:12,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:12,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:12,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076863278] [2022-12-13 01:36:12,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076863278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:36:12,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:36:12,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:36:12,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855499113] [2022-12-13 01:36:12,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:36:12,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:36:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:36:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:36:12,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 01:36:12,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 704 transitions, 11844 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-13 01:36:12,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:12,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 01:36:12,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:13,862 INFO L130 PetriNetUnfolder]: 2385/3968 cut-off events. [2022-12-13 01:36:13,863 INFO L131 PetriNetUnfolder]: For 50111/50111 co-relation queries the response was YES. [2022-12-13 01:36:13,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30243 conditions, 3968 events. 2385/3968 cut-off events. For 50111/50111 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 23571 event pairs, 588 based on Foata normal form. 108/4054 useless extension candidates. Maximal degree in co-relation 29973. Up to 3348 conditions per place. [2022-12-13 01:36:13,893 INFO L137 encePairwiseOnDemand]: 30/56 looper letters, 624 selfloop transitions, 60 changer transitions 1/685 dead transitions. [2022-12-13 01:36:13,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 685 transitions, 12685 flow [2022-12-13 01:36:13,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:36:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:36:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 01:36:13,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2022-12-13 01:36:13,894 INFO L175 Difference]: Start difference. First operand has 153 places, 704 transitions, 11844 flow. Second operand 4 states and 78 transitions. [2022-12-13 01:36:13,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 685 transitions, 12685 flow [2022-12-13 01:36:14,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 685 transitions, 12215 flow, removed 189 selfloop flow, removed 11 redundant places. [2022-12-13 01:36:14,376 INFO L231 Difference]: Finished difference. Result has 142 places, 636 transitions, 10384 flow [2022-12-13 01:36:14,376 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=9737, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10384, PETRI_PLACES=142, PETRI_TRANSITIONS=636} [2022-12-13 01:36:14,377 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 123 predicate places. [2022-12-13 01:36:14,377 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:14,377 INFO L89 Accepts]: Start accepts. Operand has 142 places, 636 transitions, 10384 flow [2022-12-13 01:36:14,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:14,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:14,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 636 transitions, 10384 flow [2022-12-13 01:36:14,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 636 transitions, 10384 flow [2022-12-13 01:36:14,598 INFO L130 PetriNetUnfolder]: 808/1689 cut-off events. [2022-12-13 01:36:14,599 INFO L131 PetriNetUnfolder]: For 23002/23293 co-relation queries the response was YES. [2022-12-13 01:36:14,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12429 conditions, 1689 events. 808/1689 cut-off events. For 23002/23293 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11267 event pairs, 5 based on Foata normal form. 7/1687 useless extension candidates. Maximal degree in co-relation 12174. Up to 671 conditions per place. [2022-12-13 01:36:14,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 636 transitions, 10384 flow [2022-12-13 01:36:14,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 1452 [2022-12-13 01:36:14,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] L40-1-->L41-6: Formula: (and (< v_~j1~0_190 (+ v_~m~0_145 1)) (= 6 v_~j1~0_190) (< v_~i1~0_183 v_~n~0_133) (= v_~k1~0_178 (+ v_~k1~0_180 6))) InVars {~m~0=v_~m~0_145, ~k1~0=v_~k1~0_180, ~i1~0=v_~i1~0_183, ~n~0=v_~n~0_133} OutVars{~m~0=v_~m~0_145, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_81|, ~k1~0=v_~k1~0_178, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_83|, ~j1~0=v_~j1~0_190, ~i1~0=v_~i1~0_183, ~n~0=v_~n~0_133} 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-13 01:36:14,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L40-1-->L41-6: Formula: (and (= v_~k1~0_154 (+ v_~k1~0_155 3)) (< 2 v_~m~0_135) (= v_~i1~0_168 (+ v_~i1~0_169 1)) (= (+ v_~k2~0_164 v_~m~0_135) v_~k2~0_163) (< v_~i1~0_168 v_~n~0_123) (< v_~i2~0_162 v_~n~0_123) (= v_~j1~0_175 0) (= v_~i2~0_161 (+ v_~i2~0_162 1)) (<= v_~m~0_135 3)) InVars {~m~0=v_~m~0_135, ~k2~0=v_~k2~0_164, ~k1~0=v_~k1~0_155, ~i2~0=v_~i2~0_162, ~i1~0=v_~i1~0_169, ~n~0=v_~n~0_123} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_78|, ~m~0=v_~m~0_135, ~k2~0=v_~k2~0_163, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_67|, ~k1~0=v_~k1~0_154, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_69|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_67|, ~j1~0=v_~j1~0_175, ~i2~0=v_~i2~0_161, ~i1~0=v_~i1~0_168, ~n~0=v_~n~0_123} 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-13 01:36:15,134 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:36:15,135 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 758 [2022-12-13 01:36:15,135 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 636 transitions, 10469 flow [2022-12-13 01:36:15,135 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-13 01:36:15,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:15,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:15,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 01:36:15,135 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:36:15,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1830476228, now seen corresponding path program 1 times [2022-12-13 01:36:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:15,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481688564] [2022-12-13 01:36:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:15,205 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-13 01:36:15,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:15,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481688564] [2022-12-13 01:36:15,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481688564] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:36:15,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046742880] [2022-12-13 01:36:15,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:15,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:36:15,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:36:15,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:36:15,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 01:36:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:15,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 01:36:15,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:36:15,302 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-13 01:36:15,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:36:15,319 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-13 01:36:15,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046742880] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:36:15,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:36:15,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 01:36:15,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896227755] [2022-12-13 01:36:15,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:36:15,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:36:15,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:15,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:36:15,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:36:15,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 01:36:15,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 636 transitions, 10469 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-13 01:36:15,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:15,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 01:36:15,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:16,477 INFO L130 PetriNetUnfolder]: 2717/4542 cut-off events. [2022-12-13 01:36:16,477 INFO L131 PetriNetUnfolder]: For 63395/63395 co-relation queries the response was YES. [2022-12-13 01:36:16,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34743 conditions, 4542 events. 2717/4542 cut-off events. For 63395/63395 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 28112 event pairs, 561 based on Foata normal form. 228/4742 useless extension candidates. Maximal degree in co-relation 34043. Up to 3211 conditions per place. [2022-12-13 01:36:16,506 INFO L137 encePairwiseOnDemand]: 27/58 looper letters, 700 selfloop transitions, 103 changer transitions 1/804 dead transitions. [2022-12-13 01:36:16,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 804 transitions, 14764 flow [2022-12-13 01:36:16,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:36:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:36:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2022-12-13 01:36:16,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22988505747126436 [2022-12-13 01:36:16,507 INFO L175 Difference]: Start difference. First operand has 141 places, 636 transitions, 10469 flow. Second operand 9 states and 120 transitions. [2022-12-13 01:36:16,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 804 transitions, 14764 flow [2022-12-13 01:36:16,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 804 transitions, 14571 flow, removed 80 selfloop flow, removed 6 redundant places. [2022-12-13 01:36:16,947 INFO L231 Difference]: Finished difference. Result has 148 places, 661 transitions, 11299 flow [2022-12-13 01:36:16,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=10189, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11299, PETRI_PLACES=148, PETRI_TRANSITIONS=661} [2022-12-13 01:36:16,948 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 129 predicate places. [2022-12-13 01:36:16,948 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:16,948 INFO L89 Accepts]: Start accepts. Operand has 148 places, 661 transitions, 11299 flow [2022-12-13 01:36:16,950 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:16,950 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:16,950 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 661 transitions, 11299 flow [2022-12-13 01:36:16,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 661 transitions, 11299 flow [2022-12-13 01:36:17,246 INFO L130 PetriNetUnfolder]: 908/1907 cut-off events. [2022-12-13 01:36:17,246 INFO L131 PetriNetUnfolder]: For 32286/33817 co-relation queries the response was YES. [2022-12-13 01:36:17,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15099 conditions, 1907 events. 908/1907 cut-off events. For 32286/33817 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 13241 event pairs, 12 based on Foata normal form. 0/1898 useless extension candidates. Maximal degree in co-relation 14880. Up to 816 conditions per place. [2022-12-13 01:36:17,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 661 transitions, 11299 flow [2022-12-13 01:36:17,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 1538 [2022-12-13 01:36:17,575 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:36:17,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 628 [2022-12-13 01:36:17,576 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 661 transitions, 11345 flow [2022-12-13 01:36:17,576 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-13 01:36:17,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:17,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:17,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 01:36:17,780 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-13 01:36:17,781 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:36:17,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:17,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1801030015, now seen corresponding path program 1 times [2022-12-13 01:36:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:17,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896007479] [2022-12-13 01:36:17,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:17,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:18,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:18,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896007479] [2022-12-13 01:36:18,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896007479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:36:18,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869857050] [2022-12-13 01:36:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:18,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:36:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:36:18,044 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:36:18,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 01:36:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:18,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 01:36:18,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:36:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:18,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:36:18,758 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-13 01:36:18,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869857050] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:36:18,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:36:18,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-13 01:36:18,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957009460] [2022-12-13 01:36:18,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:36:18,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:36:18,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:18,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:36:18,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:36:18,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 01:36:18,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 661 transitions, 11345 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-13 01:36:18,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:18,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 01:36:18,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:21,050 INFO L130 PetriNetUnfolder]: 2851/4786 cut-off events. [2022-12-13 01:36:21,050 INFO L131 PetriNetUnfolder]: For 68497/68497 co-relation queries the response was YES. [2022-12-13 01:36:21,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38654 conditions, 4786 events. 2851/4786 cut-off events. For 68497/68497 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 30123 event pairs, 30 based on Foata normal form. 2/4764 useless extension candidates. Maximal degree in co-relation 38418. Up to 4331 conditions per place. [2022-12-13 01:36:21,086 INFO L137 encePairwiseOnDemand]: 13/62 looper letters, 616 selfloop transitions, 143 changer transitions 24/783 dead transitions. [2022-12-13 01:36:21,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 783 transitions, 14566 flow [2022-12-13 01:36:21,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 01:36:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 01:36:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 161 transitions. [2022-12-13 01:36:21,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1622983870967742 [2022-12-13 01:36:21,089 INFO L175 Difference]: Start difference. First operand has 146 places, 661 transitions, 11345 flow. Second operand 16 states and 161 transitions. [2022-12-13 01:36:21,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 783 transitions, 14566 flow [2022-12-13 01:36:21,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 783 transitions, 14277 flow, removed 70 selfloop flow, removed 3 redundant places. [2022-12-13 01:36:21,740 INFO L231 Difference]: Finished difference. Result has 165 places, 710 transitions, 12408 flow [2022-12-13 01:36:21,741 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=11114, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12408, PETRI_PLACES=165, PETRI_TRANSITIONS=710} [2022-12-13 01:36:21,741 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 146 predicate places. [2022-12-13 01:36:21,741 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:21,742 INFO L89 Accepts]: Start accepts. Operand has 165 places, 710 transitions, 12408 flow [2022-12-13 01:36:21,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:21,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:21,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 710 transitions, 12408 flow [2022-12-13 01:36:21,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 710 transitions, 12408 flow [2022-12-13 01:36:22,047 INFO L130 PetriNetUnfolder]: 944/1990 cut-off events. [2022-12-13 01:36:22,047 INFO L131 PetriNetUnfolder]: For 34017/35059 co-relation queries the response was YES. [2022-12-13 01:36:22,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15889 conditions, 1990 events. 944/1990 cut-off events. For 34017/35059 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14010 event pairs, 12 based on Foata normal form. 11/1992 useless extension candidates. Maximal degree in co-relation 15497. Up to 879 conditions per place. [2022-12-13 01:36:22,079 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 710 transitions, 12408 flow [2022-12-13 01:36:22,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 1662 [2022-12-13 01:36:22,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] L40-1-->L41-6: Formula: (and (< v_~j1~0_216 (+ v_~m~0_163 1)) (= v_~k1~0_196 (+ v_~k1~0_198 7)) (= 7 v_~j1~0_216) (< v_~i1~0_209 v_~n~0_151)) InVars {~m~0=v_~m~0_163, ~k1~0=v_~k1~0_198, ~i1~0=v_~i1~0_209, ~n~0=v_~n~0_151} OutVars{~m~0=v_~m~0_163, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_91|, ~k1~0=v_~k1~0_196, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_93|, ~j1~0=v_~j1~0_216, ~i1~0=v_~i1~0_209, ~n~0=v_~n~0_151} 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-13 01:36:22,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:36:22,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:36:22,732 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:36:22,733 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 992 [2022-12-13 01:36:22,733 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 710 transitions, 12489 flow [2022-12-13 01:36:22,734 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-13 01:36:22,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:22,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:22,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 01:36:22,935 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-13 01:36:22,935 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:36:22,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash -891841346, now seen corresponding path program 1 times [2022-12-13 01:36:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:22,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075605184] [2022-12-13 01:36:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:23,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:23,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075605184] [2022-12-13 01:36:23,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075605184] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:36:23,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37841078] [2022-12-13 01:36:23,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:23,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:36:23,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:36:23,210 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:36:23,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 01:36:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:23,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 01:36:23,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:36:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:23,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:36:23,719 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-13 01:36:23,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37841078] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:36:23,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:36:23,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-13 01:36:23,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300298668] [2022-12-13 01:36:23,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:36:23,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:36:23,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:23,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:36:23,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:36:23,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 01:36:23,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 710 transitions, 12489 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-13 01:36:23,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:23,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 01:36:23,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:27,347 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-13 01:36:28,511 INFO L130 PetriNetUnfolder]: 3115/5261 cut-off events. [2022-12-13 01:36:28,511 INFO L131 PetriNetUnfolder]: For 78507/78507 co-relation queries the response was YES. [2022-12-13 01:36:28,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43138 conditions, 5261 events. 3115/5261 cut-off events. For 78507/78507 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 34214 event pairs, 16 based on Foata normal form. 5/5242 useless extension candidates. Maximal degree in co-relation 41745. Up to 3504 conditions per place. [2022-12-13 01:36:28,553 INFO L137 encePairwiseOnDemand]: 13/70 looper letters, 421 selfloop transitions, 441 changer transitions 22/884 dead transitions. [2022-12-13 01:36:28,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 884 transitions, 17153 flow [2022-12-13 01:36:28,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 01:36:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 01:36:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-12-13 01:36:28,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14952380952380953 [2022-12-13 01:36:28,555 INFO L175 Difference]: Start difference. First operand has 165 places, 710 transitions, 12489 flow. Second operand 15 states and 157 transitions. [2022-12-13 01:36:28,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 884 transitions, 17153 flow [2022-12-13 01:36:29,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 884 transitions, 16711 flow, removed 194 selfloop flow, removed 3 redundant places. [2022-12-13 01:36:29,328 INFO L231 Difference]: Finished difference. Result has 181 places, 826 transitions, 15827 flow [2022-12-13 01:36:29,329 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=12090, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=339, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=15827, PETRI_PLACES=181, PETRI_TRANSITIONS=826} [2022-12-13 01:36:29,330 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 162 predicate places. [2022-12-13 01:36:29,330 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:29,330 INFO L89 Accepts]: Start accepts. Operand has 181 places, 826 transitions, 15827 flow [2022-12-13 01:36:29,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:29,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:29,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 826 transitions, 15827 flow [2022-12-13 01:36:29,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 826 transitions, 15827 flow [2022-12-13 01:36:29,722 INFO L130 PetriNetUnfolder]: 1021/2153 cut-off events. [2022-12-13 01:36:29,723 INFO L131 PetriNetUnfolder]: For 41179/42448 co-relation queries the response was YES. [2022-12-13 01:36:29,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18638 conditions, 2153 events. 1021/2153 cut-off events. For 41179/42448 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 15569 event pairs, 5 based on Foata normal form. 12/2156 useless extension candidates. Maximal degree in co-relation 18141. Up to 959 conditions per place. [2022-12-13 01:36:29,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 826 transitions, 15827 flow [2022-12-13 01:36:29,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-13 01:36:29,763 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [448] L40-1-->L41-6: Formula: (and (<= v_~m~0_167 3) (< v_~i2~0_207 v_~n~0_155) (= v_~i1~0_215 (+ v_~i1~0_216 1)) (< v_~i1~0_215 v_~n~0_155) (= v_~i2~0_206 (+ v_~i2~0_207 1)) (= (+ v_~k1~0_208 4) v_~k1~0_206) (= v_~j1~0_222 1) (= v_~k2~0_207 (+ v_~k2~0_208 v_~m~0_167)) (< 2 v_~m~0_167)) InVars {~m~0=v_~m~0_167, ~k1~0=v_~k1~0_208, ~k2~0=v_~k2~0_208, ~i2~0=v_~i2~0_207, ~i1~0=v_~i1~0_216, ~n~0=v_~n~0_155} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_102|, ~m~0=v_~m~0_167, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_97|, ~k1~0=v_~k1~0_206, ~k2~0=v_~k2~0_207, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_99|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_83|, ~j1~0=v_~j1~0_222, ~i2~0=v_~i2~0_206, ~i1~0=v_~i1~0_215, ~n~0=v_~n~0_155} 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-13 01:36:30,034 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:36:30,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:36:30,286 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-13 01:36:30,320 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:36:30,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 990 [2022-12-13 01:36:30,320 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 825 transitions, 15914 flow [2022-12-13 01:36:30,320 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-13 01:36:30,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:30,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:30,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 01:36:30,521 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-13 01:36:30,521 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:36:30,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:30,522 INFO L85 PathProgramCache]: Analyzing trace with hash -85084772, now seen corresponding path program 1 times [2022-12-13 01:36:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:30,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336359428] [2022-12-13 01:36:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:36:30,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:30,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336359428] [2022-12-13 01:36:30,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336359428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:36:30,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:36:30,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:36:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225173377] [2022-12-13 01:36:30,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:36:30,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:36:30,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:30,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:36:30,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:36:30,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 01:36:30,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 825 transitions, 15914 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-13 01:36:30,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:30,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 01:36:30,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:32,350 INFO L130 PetriNetUnfolder]: 4115/7048 cut-off events. [2022-12-13 01:36:32,350 INFO L131 PetriNetUnfolder]: For 131010/131010 co-relation queries the response was YES. [2022-12-13 01:36:32,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60545 conditions, 7048 events. 4115/7048 cut-off events. For 131010/131010 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 48400 event pairs, 491 based on Foata normal form. 136/7156 useless extension candidates. Maximal degree in co-relation 59900. Up to 3692 conditions per place. [2022-12-13 01:36:32,419 INFO L137 encePairwiseOnDemand]: 41/78 looper letters, 845 selfloop transitions, 341 changer transitions 5/1191 dead transitions. [2022-12-13 01:36:32,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1191 transitions, 24578 flow [2022-12-13 01:36:32,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:36:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:36:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-12-13 01:36:32,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3301282051282051 [2022-12-13 01:36:32,420 INFO L175 Difference]: Start difference. First operand has 179 places, 825 transitions, 15914 flow. Second operand 4 states and 103 transitions. [2022-12-13 01:36:32,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1191 transitions, 24578 flow [2022-12-13 01:36:33,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 1191 transitions, 23990 flow, removed 223 selfloop flow, removed 9 redundant places. [2022-12-13 01:36:33,670 INFO L231 Difference]: Finished difference. Result has 175 places, 986 transitions, 19882 flow [2022-12-13 01:36:33,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=14965, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=19882, PETRI_PLACES=175, PETRI_TRANSITIONS=986} [2022-12-13 01:36:33,671 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 156 predicate places. [2022-12-13 01:36:33,671 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:33,671 INFO L89 Accepts]: Start accepts. Operand has 175 places, 986 transitions, 19882 flow [2022-12-13 01:36:33,674 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:33,675 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:33,675 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 986 transitions, 19882 flow [2022-12-13 01:36:33,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 986 transitions, 19882 flow [2022-12-13 01:36:34,155 INFO L130 PetriNetUnfolder]: 1373/3024 cut-off events. [2022-12-13 01:36:34,155 INFO L131 PetriNetUnfolder]: For 67165/70494 co-relation queries the response was YES. [2022-12-13 01:36:34,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26319 conditions, 3024 events. 1373/3024 cut-off events. For 67165/70494 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 23932 event pairs, 11 based on Foata normal form. 5/3020 useless extension candidates. Maximal degree in co-relation 25871. Up to 1240 conditions per place. [2022-12-13 01:36:34,189 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 986 transitions, 19882 flow [2022-12-13 01:36:34,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 2222 [2022-12-13 01:36:34,223 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-13 01:36:34,256 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:36:34,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 586 [2022-12-13 01:36:34,257 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 986 transitions, 19912 flow [2022-12-13 01:36:34,257 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-13 01:36:34,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:34,257 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:34,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 01:36:34,257 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:36:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash 820367925, now seen corresponding path program 1 times [2022-12-13 01:36:34,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:34,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347884596] [2022-12-13 01:36:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:36:34,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:34,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347884596] [2022-12-13 01:36:34,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347884596] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:36:34,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626123127] [2022-12-13 01:36:34,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:34,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:36:34,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:36:34,316 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:36:34,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 01:36:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:34,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:36:34,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:36:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:36:34,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:36:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:36:34,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626123127] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:36:34,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:36:34,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 6 [2022-12-13 01:36:34,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492438392] [2022-12-13 01:36:34,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:36:34,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:36:34,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:34,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:36:34,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:36:34,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-13 01:36:34,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 986 transitions, 19912 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:36:34,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:34,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-13 01:36:34,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:37,015 INFO L130 PetriNetUnfolder]: 4771/8290 cut-off events. [2022-12-13 01:36:37,016 INFO L131 PetriNetUnfolder]: For 160940/160940 co-relation queries the response was YES. [2022-12-13 01:36:37,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73375 conditions, 8290 events. 4771/8290 cut-off events. For 160940/160940 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 59098 event pairs, 69 based on Foata normal form. 72/8334 useless extension candidates. Maximal degree in co-relation 72375. Up to 6527 conditions per place. [2022-12-13 01:36:37,085 INFO L137 encePairwiseOnDemand]: 42/75 looper letters, 1101 selfloop transitions, 205 changer transitions 13/1319 dead transitions. [2022-12-13 01:36:37,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 1319 transitions, 28281 flow [2022-12-13 01:36:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:36:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:36:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2022-12-13 01:36:37,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21 [2022-12-13 01:36:37,087 INFO L175 Difference]: Start difference. First operand has 173 places, 986 transitions, 19912 flow. Second operand 8 states and 126 transitions. [2022-12-13 01:36:37,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 1319 transitions, 28281 flow [2022-12-13 01:36:38,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1319 transitions, 28160 flow, removed 60 selfloop flow, removed 1 redundant places. [2022-12-13 01:36:38,531 INFO L231 Difference]: Finished difference. Result has 182 places, 1107 transitions, 23390 flow [2022-12-13 01:36:38,532 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=19596, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=23390, PETRI_PLACES=182, PETRI_TRANSITIONS=1107} [2022-12-13 01:36:38,532 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 163 predicate places. [2022-12-13 01:36:38,532 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:38,533 INFO L89 Accepts]: Start accepts. Operand has 182 places, 1107 transitions, 23390 flow [2022-12-13 01:36:38,538 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:38,538 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:38,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 1107 transitions, 23390 flow [2022-12-13 01:36:38,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 1107 transitions, 23390 flow [2022-12-13 01:36:39,239 INFO L130 PetriNetUnfolder]: 1590/3609 cut-off events. [2022-12-13 01:36:39,239 INFO L131 PetriNetUnfolder]: For 83606/86786 co-relation queries the response was YES. [2022-12-13 01:36:39,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31702 conditions, 3609 events. 1590/3609 cut-off events. For 83606/86786 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 30169 event pairs, 16 based on Foata normal form. 3/3603 useless extension candidates. Maximal degree in co-relation 31229. Up to 1433 conditions per place. [2022-12-13 01:36:39,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 1107 transitions, 23390 flow [2022-12-13 01:36:39,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 2460 [2022-12-13 01:36:39,289 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:36:39,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 758 [2022-12-13 01:36:39,290 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 1107 transitions, 23390 flow [2022-12-13 01:36:39,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:36:39,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:39,290 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:39,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 01:36:39,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 01:36:39,492 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:36:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash -924225857, now seen corresponding path program 1 times [2022-12-13 01:36:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:39,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48806865] [2022-12-13 01:36:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:39,865 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-13 01:36:39,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:39,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48806865] [2022-12-13 01:36:39,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48806865] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:36:39,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441750283] [2022-12-13 01:36:39,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:39,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:36:39,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:36:39,867 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:36:39,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 01:36:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:40,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 01:36:40,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:36:40,296 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-13 01:36:40,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:36:40,568 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-13 01:36:40,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441750283] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:36:40,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:36:40,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 01:36:40,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613926597] [2022-12-13 01:36:40,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:36:40,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 01:36:40,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:40,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 01:36:40,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-13 01:36:40,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-13 01:36:40,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 1107 transitions, 23390 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-13 01:36:40,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:40,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-13 01:36:40,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:54,184 INFO L130 PetriNetUnfolder]: 5270/9216 cut-off events. [2022-12-13 01:36:54,184 INFO L131 PetriNetUnfolder]: For 179133/179133 co-relation queries the response was YES. [2022-12-13 01:36:54,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82859 conditions, 9216 events. 5270/9216 cut-off events. For 179133/179133 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 67157 event pairs, 44 based on Foata normal form. 2/9190 useless extension candidates. Maximal degree in co-relation 81718. Up to 5912 conditions per place. [2022-12-13 01:36:54,261 INFO L137 encePairwiseOnDemand]: 15/74 looper letters, 678 selfloop transitions, 710 changer transitions 28/1416 dead transitions. [2022-12-13 01:36:54,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 1416 transitions, 31448 flow [2022-12-13 01:36:54,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 01:36:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 01:36:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 246 transitions. [2022-12-13 01:36:54,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11081081081081082 [2022-12-13 01:36:54,264 INFO L175 Difference]: Start difference. First operand has 181 places, 1107 transitions, 23390 flow. Second operand 30 states and 246 transitions. [2022-12-13 01:36:54,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 1416 transitions, 31448 flow [2022-12-13 01:36:55,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 1416 transitions, 30475 flow, removed 398 selfloop flow, removed 4 redundant places. [2022-12-13 01:36:55,794 INFO L231 Difference]: Finished difference. Result has 216 places, 1314 transitions, 29968 flow [2022-12-13 01:36:55,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=22636, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=534, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=29968, PETRI_PLACES=216, PETRI_TRANSITIONS=1314} [2022-12-13 01:36:55,795 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 197 predicate places. [2022-12-13 01:36:55,795 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:55,796 INFO L89 Accepts]: Start accepts. Operand has 216 places, 1314 transitions, 29968 flow [2022-12-13 01:36:55,802 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:55,802 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:55,802 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 1314 transitions, 29968 flow [2022-12-13 01:36:55,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 1314 transitions, 29968 flow [2022-12-13 01:36:56,857 INFO L130 PetriNetUnfolder]: 1743/3998 cut-off events. [2022-12-13 01:36:56,857 INFO L131 PetriNetUnfolder]: For 103313/105582 co-relation queries the response was YES. [2022-12-13 01:36:56,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37626 conditions, 3998 events. 1743/3998 cut-off events. For 103313/105582 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 34241 event pairs, 17 based on Foata normal form. 2/3992 useless extension candidates. Maximal degree in co-relation 37110. Up to 1614 conditions per place. [2022-12-13 01:36:56,907 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 1314 transitions, 29968 flow [2022-12-13 01:36:56,907 INFO L226 LiptonReduction]: Number of co-enabled transitions 2946 [2022-12-13 01:36:56,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:36:57,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [458] L40-1-->L41-6: Formula: (and (< v_~j1~0_281 (+ v_~m~0_187 1)) (= 8 v_~j1~0_281) (= v_~k1~0_268 (+ v_~k1~0_270 8)) (< v_~i1~0_232 v_~n~0_163)) InVars {~m~0=v_~m~0_187, ~k1~0=v_~k1~0_270, ~i1~0=v_~i1~0_232, ~n~0=v_~n~0_163} OutVars{~m~0=v_~m~0_187, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_139|, ~k1~0=v_~k1~0_268, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_141|, ~j1~0=v_~j1~0_281, ~i1~0=v_~i1~0_232, ~n~0=v_~n~0_163} 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-13 01:36:57,328 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-13 01:36:57,400 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-13 01:36:57,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [483] L40-1-->L51-1: Formula: (and (= v_~i2~0_258 (+ v_~i2~0_259 1)) (= 8 v_~j1~0_386) (< v_~j1~0_386 (+ v_~m~0_237 1)) (< v_~i2~0_259 v_~n~0_199) (< v_~i1~0_298 v_~n~0_199) (= (+ v_~k2~0_258 v_~m~0_237) v_~k2~0_257) (not (< v_~j1~0_386 v_~m~0_237)) (= v_~i1~0_297 (+ v_~i1~0_298 1)) (= (+ v_~k1~0_353 8) v_~k1~0_352)) InVars {~m~0=v_~m~0_237, ~k2~0=v_~k2~0_258, ~k1~0=v_~k1~0_353, ~i2~0=v_~i2~0_259, ~i1~0=v_~i1~0_298, ~n~0=v_~n~0_199} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_133|, ~m~0=v_~m~0_237, ~k2~0=v_~k2~0_257, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_194|, ~k1~0=v_~k1~0_352, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_196|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_124|, ~i2~0=v_~i2~0_258, ~j1~0=v_~j1~0_386, ~i1~0=v_~i1~0_297, ~n~0=v_~n~0_199} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~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-13 01:36:57,746 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-13 01:36:57,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] L40-1-->L51-1: Formula: (and (< v_~i1~0_309 v_~n~0_207) (= v_~j1~0_398 0) (= v_~i2~0_266 (+ v_~i2~0_267 1)) (< v_~i2~0_267 v_~n~0_207) (= (+ v_~k2~0_266 v_~m~0_245) v_~k2~0_265)) InVars {~m~0=v_~m~0_245, ~k2~0=v_~k2~0_266, ~i2~0=v_~i2~0_267, ~i1~0=v_~i1~0_309, ~n~0=v_~n~0_207} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_137|, ~m~0=v_~m~0_245, ~k2~0=v_~k2~0_265, ~i2~0=v_~i2~0_266, ~j1~0=v_~j1~0_398, ~i1~0=v_~i1~0_309, ~n~0=v_~n~0_207} 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-13 01:36:57,937 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:36:58,078 INFO L241 LiptonReduction]: Total number of compositions: 9 [2022-12-13 01:36:58,079 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2284 [2022-12-13 01:36:58,079 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 1311 transitions, 30185 flow [2022-12-13 01:36:58,079 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-13 01:36:58,079 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:58,079 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:58,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 01:36:58,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 01:36:58,285 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:36:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2097319923, now seen corresponding path program 1 times [2022-12-13 01:36:58,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:58,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553491371] [2022-12-13 01:36:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:58,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:58,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:58,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553491371] [2022-12-13 01:36:58,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553491371] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:36:58,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143680720] [2022-12-13 01:36:58,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:58,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:36:58,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:36:58,534 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:36:58,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 01:36:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:58,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 01:36:58,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:36:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:36:58,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:36:59,126 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-13 01:36:59,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143680720] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:36:59,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:36:59,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 01:36:59,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550333223] [2022-12-13 01:36:59,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:36:59,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:36:59,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:59,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:36:59,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-13 01:36:59,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 88 [2022-12-13 01:36:59,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 1311 transitions, 30185 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-13 01:36:59,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:59,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 88 [2022-12-13 01:36:59,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:37:06,048 INFO L130 PetriNetUnfolder]: 5419/9475 cut-off events. [2022-12-13 01:37:06,049 INFO L131 PetriNetUnfolder]: For 202502/202502 co-relation queries the response was YES. [2022-12-13 01:37:06,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90814 conditions, 9475 events. 5419/9475 cut-off events. For 202502/202502 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 69288 event pairs, 40 based on Foata normal form. 2/9453 useless extension candidates. Maximal degree in co-relation 89703. Up to 6327 conditions per place. [2022-12-13 01:37:06,138 INFO L137 encePairwiseOnDemand]: 19/88 looper letters, 693 selfloop transitions, 726 changer transitions 26/1445 dead transitions. [2022-12-13 01:37:06,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 1445 transitions, 35299 flow [2022-12-13 01:37:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 01:37:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 01:37:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 195 transitions. [2022-12-13 01:37:06,139 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1166267942583732 [2022-12-13 01:37:06,139 INFO L175 Difference]: Start difference. First operand has 214 places, 1311 transitions, 30185 flow. Second operand 19 states and 195 transitions. [2022-12-13 01:37:06,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 1445 transitions, 35299 flow [2022-12-13 01:37:08,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 1445 transitions, 33771 flow, removed 727 selfloop flow, removed 7 redundant places. [2022-12-13 01:37:08,659 INFO L231 Difference]: Finished difference. Result has 232 places, 1378 transitions, 33200 flow [2022-12-13 01:37:08,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=28727, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=662, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=33200, PETRI_PLACES=232, PETRI_TRANSITIONS=1378} [2022-12-13 01:37:08,660 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 213 predicate places. [2022-12-13 01:37:08,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:37:08,661 INFO L89 Accepts]: Start accepts. Operand has 232 places, 1378 transitions, 33200 flow [2022-12-13 01:37:08,666 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:37:08,666 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:37:08,667 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 1378 transitions, 33200 flow [2022-12-13 01:37:08,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 1378 transitions, 33200 flow [2022-12-13 01:37:09,526 INFO L130 PetriNetUnfolder]: 1789/4091 cut-off events. [2022-12-13 01:37:09,526 INFO L131 PetriNetUnfolder]: For 116090/119141 co-relation queries the response was YES. [2022-12-13 01:37:09,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40382 conditions, 4091 events. 1789/4091 cut-off events. For 116090/119141 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 34987 event pairs, 14 based on Foata normal form. 1/4081 useless extension candidates. Maximal degree in co-relation 39952. Up to 1641 conditions per place. [2022-12-13 01:37:09,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 1378 transitions, 33200 flow [2022-12-13 01:37:09,583 INFO L226 LiptonReduction]: Number of co-enabled transitions 3074 [2022-12-13 01:37:09,595 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:37:09,769 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:37:09,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L40-1-->L41-6: Formula: (and (< v_~i1~0_303 v_~n~0_203) (< 7 v_~m~0_241) (= (+ v_~i1~0_304 1) v_~i1~0_303) (= v_~j1~0_392 0) (<= v_~m~0_241 8) (= v_~k1~0_362 (+ v_~k1~0_363 8))) InVars {~m~0=v_~m~0_241, ~k1~0=v_~k1~0_363, ~i1~0=v_~i1~0_304, ~n~0=v_~n~0_203} OutVars{~m~0=v_~m~0_241, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_200|, ~k1~0=v_~k1~0_362, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_202|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_126|, ~j1~0=v_~j1~0_392, ~i1~0=v_~i1~0_303, ~n~0=v_~n~0_203} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, 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-13 01:37:10,167 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-13 01:37:10,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L40-1-->L51-1: Formula: (and (< v_~j1~0_396 (+ v_~m~0_243 1)) (< v_~i1~0_307 v_~n~0_205) (= v_~k2~0_261 (+ v_~k2~0_262 v_~m~0_243)) (= v_~i2~0_262 (+ v_~i2~0_263 1)) (= v_~k1~0_366 (+ v_~k1~0_367 8)) (= 8 v_~j1~0_396) (< v_~i2~0_263 v_~n~0_205)) InVars {~m~0=v_~m~0_243, ~k2~0=v_~k2~0_262, ~k1~0=v_~k1~0_367, ~i2~0=v_~i2~0_263, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_135|, ~m~0=v_~m~0_243, ~k2~0=v_~k2~0_261, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_202|, ~k1~0=v_~k1~0_366, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_204|, ~i2~0=v_~i2~0_262, ~j1~0=v_~j1~0_396, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [511] L41-6-->L41-6: Formula: (and (= (+ 2 v_~j1~0_485) v_~j1~0_483) (= v_~k1~0_434 (+ v_~k1~0_436 2)) (< (+ v_~j1~0_485 1) v_~m~0_293)) InVars {~m~0=v_~m~0_293, ~k1~0=v_~k1~0_436, ~j1~0=v_~j1~0_485} OutVars{~m~0=v_~m~0_293, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_239|, ~k1~0=v_~k1~0_434, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_241|, ~j1~0=v_~j1~0_483} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] [2022-12-13 01:37:10,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L40-1-->L51-1: Formula: (and (< v_~j1~0_396 (+ v_~m~0_243 1)) (< v_~i1~0_307 v_~n~0_205) (= v_~k2~0_261 (+ v_~k2~0_262 v_~m~0_243)) (= v_~i2~0_262 (+ v_~i2~0_263 1)) (= v_~k1~0_366 (+ v_~k1~0_367 8)) (= 8 v_~j1~0_396) (< v_~i2~0_263 v_~n~0_205)) InVars {~m~0=v_~m~0_243, ~k2~0=v_~k2~0_262, ~k1~0=v_~k1~0_367, ~i2~0=v_~i2~0_263, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_135|, ~m~0=v_~m~0_243, ~k2~0=v_~k2~0_261, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_202|, ~k1~0=v_~k1~0_366, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_204|, ~i2~0=v_~i2~0_262, ~j1~0=v_~j1~0_396, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} 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_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-13 01:37:10,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L40-1-->L51-1: Formula: (and (< v_~j1~0_396 (+ v_~m~0_243 1)) (< v_~i1~0_307 v_~n~0_205) (= v_~k2~0_261 (+ v_~k2~0_262 v_~m~0_243)) (= v_~i2~0_262 (+ v_~i2~0_263 1)) (= v_~k1~0_366 (+ v_~k1~0_367 8)) (= 8 v_~j1~0_396) (< v_~i2~0_263 v_~n~0_205)) InVars {~m~0=v_~m~0_243, ~k2~0=v_~k2~0_262, ~k1~0=v_~k1~0_367, ~i2~0=v_~i2~0_263, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_135|, ~m~0=v_~m~0_243, ~k2~0=v_~k2~0_261, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_202|, ~k1~0=v_~k1~0_366, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_204|, ~i2~0=v_~i2~0_262, ~j1~0=v_~j1~0_396, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [500] L41-6-->L51-1: Formula: (and (= v_~i2~0_309 (+ v_~i2~0_310 1)) (= v_~k2~0_309 (+ v_~k2~0_310 v_~m~0_271)) (= v_~i1~0_342 (+ v_~i1~0_343 1)) (< v_~i2~0_310 v_~n~0_233) (not (< v_~j1~0_441 v_~m~0_271))) InVars {~m~0=v_~m~0_271, ~k2~0=v_~k2~0_310, ~i2~0=v_~i2~0_310, ~j1~0=v_~j1~0_441, ~i1~0=v_~i1~0_343, ~n~0=v_~n~0_233} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_163|, ~m~0=v_~m~0_271, ~k2~0=v_~k2~0_309, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_140|, ~i2~0=v_~i2~0_309, ~j1~0=v_~j1~0_441, ~i1~0=v_~i1~0_342, ~n~0=v_~n~0_233} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0] [2022-12-13 01:37:10,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L40-1-->L51-1: Formula: (and (< v_~j1~0_396 (+ v_~m~0_243 1)) (< v_~i1~0_307 v_~n~0_205) (= v_~k2~0_261 (+ v_~k2~0_262 v_~m~0_243)) (= v_~i2~0_262 (+ v_~i2~0_263 1)) (= v_~k1~0_366 (+ v_~k1~0_367 8)) (= 8 v_~j1~0_396) (< v_~i2~0_263 v_~n~0_205)) InVars {~m~0=v_~m~0_243, ~k2~0=v_~k2~0_262, ~k1~0=v_~k1~0_367, ~i2~0=v_~i2~0_263, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_135|, ~m~0=v_~m~0_243, ~k2~0=v_~k2~0_261, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_202|, ~k1~0=v_~k1~0_366, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_204|, ~i2~0=v_~i2~0_262, ~j1~0=v_~j1~0_396, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [501] L41-6-->L41-6: Formula: (and (not (< v_~j1~0_444 v_~m~0_273)) (= v_~i1~0_346 (+ v_~i1~0_347 1)) (= v_~j1~0_443 0) (< v_~i1~0_346 v_~n~0_235)) InVars {~m~0=v_~m~0_273, ~j1~0=v_~j1~0_444, ~i1~0=v_~i1~0_347, ~n~0=v_~n~0_235} OutVars{~m~0=v_~m~0_273, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_142|, ~j1~0=v_~j1~0_443, ~i1~0=v_~i1~0_346, ~n~0=v_~n~0_235} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-13 01:37:10,802 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L40-1-->L51-1: Formula: (and (< v_~j1~0_396 (+ v_~m~0_243 1)) (< v_~i1~0_307 v_~n~0_205) (= v_~k2~0_261 (+ v_~k2~0_262 v_~m~0_243)) (= v_~i2~0_262 (+ v_~i2~0_263 1)) (= v_~k1~0_366 (+ v_~k1~0_367 8)) (= 8 v_~j1~0_396) (< v_~i2~0_263 v_~n~0_205)) InVars {~m~0=v_~m~0_243, ~k2~0=v_~k2~0_262, ~k1~0=v_~k1~0_367, ~i2~0=v_~i2~0_263, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_135|, ~m~0=v_~m~0_243, ~k2~0=v_~k2~0_261, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_202|, ~k1~0=v_~k1~0_366, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_204|, ~i2~0=v_~i2~0_262, ~j1~0=v_~j1~0_396, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [506] L41-6-->L41-6: Formula: (and (<= v_~m~0_283 (+ v_~j1~0_461 1)) (< v_~j1~0_461 v_~m~0_283) (= v_~i1~0_366 (+ v_~i1~0_367 1)) (< v_~i1~0_366 v_~n~0_245) (= v_~j1~0_459 0) (= v_~k1~0_414 (+ v_~k1~0_415 1))) InVars {~m~0=v_~m~0_283, ~k1~0=v_~k1~0_415, ~j1~0=v_~j1~0_461, ~i1~0=v_~i1~0_367, ~n~0=v_~n~0_245} OutVars{~m~0=v_~m~0_283, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_229|, ~k1~0=v_~k1~0_414, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_231|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_152|, ~j1~0=v_~j1~0_459, ~i1~0=v_~i1~0_366, ~n~0=v_~n~0_245} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-13 01:37:10,910 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L40-1-->L51-1: Formula: (and (< v_~j1~0_396 (+ v_~m~0_243 1)) (< v_~i1~0_307 v_~n~0_205) (= v_~k2~0_261 (+ v_~k2~0_262 v_~m~0_243)) (= v_~i2~0_262 (+ v_~i2~0_263 1)) (= v_~k1~0_366 (+ v_~k1~0_367 8)) (= 8 v_~j1~0_396) (< v_~i2~0_263 v_~n~0_205)) InVars {~m~0=v_~m~0_243, ~k2~0=v_~k2~0_262, ~k1~0=v_~k1~0_367, ~i2~0=v_~i2~0_263, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_135|, ~m~0=v_~m~0_243, ~k2~0=v_~k2~0_261, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_202|, ~k1~0=v_~k1~0_366, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_204|, ~i2~0=v_~i2~0_262, ~j1~0=v_~j1~0_396, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [507] L41-6-->L40-1: Formula: (and (= v_~i1~0_370 (+ v_~i1~0_371 1)) (= (+ v_~j1~0_466 1) v_~j1~0_465) (not (< v_~j1~0_465 v_~m~0_285)) (= v_~k1~0_418 (+ v_~k1~0_419 1)) (< v_~j1~0_466 v_~m~0_285)) InVars {~m~0=v_~m~0_285, ~k1~0=v_~k1~0_419, ~j1~0=v_~j1~0_466, ~i1~0=v_~i1~0_371} OutVars{~m~0=v_~m~0_285, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_231|, ~k1~0=v_~k1~0_418, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_233|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_154|, ~j1~0=v_~j1~0_465, ~i1~0=v_~i1~0_370} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-13 01:37:11,017 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L40-1-->L51-1: Formula: (and (< v_~j1~0_396 (+ v_~m~0_243 1)) (< v_~i1~0_307 v_~n~0_205) (= v_~k2~0_261 (+ v_~k2~0_262 v_~m~0_243)) (= v_~i2~0_262 (+ v_~i2~0_263 1)) (= v_~k1~0_366 (+ v_~k1~0_367 8)) (= 8 v_~j1~0_396) (< v_~i2~0_263 v_~n~0_205)) InVars {~m~0=v_~m~0_243, ~k2~0=v_~k2~0_262, ~k1~0=v_~k1~0_367, ~i2~0=v_~i2~0_263, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_135|, ~m~0=v_~m~0_243, ~k2~0=v_~k2~0_261, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_202|, ~k1~0=v_~k1~0_366, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_204|, ~i2~0=v_~i2~0_262, ~j1~0=v_~j1~0_396, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [508] L41-6-->L51-1: Formula: (and (= v_~k2~0_321 (+ v_~k2~0_322 v_~m~0_287)) (< v_~i2~0_322 v_~n~0_247) (= v_~k1~0_422 (+ v_~k1~0_423 1)) (= v_~i2~0_321 (+ v_~i2~0_322 1)) (< v_~j1~0_470 v_~m~0_287) (= (+ v_~j1~0_470 1) v_~j1~0_469)) InVars {~m~0=v_~m~0_287, ~k2~0=v_~k2~0_322, ~k1~0=v_~k1~0_423, ~i2~0=v_~i2~0_322, ~j1~0=v_~j1~0_470, ~n~0=v_~n~0_247} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_169|, ~m~0=v_~m~0_287, ~k2~0=v_~k2~0_321, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_233|, ~k1~0=v_~k1~0_422, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_235|, ~i2~0=v_~i2~0_321, ~j1~0=v_~j1~0_469, ~n~0=v_~n~0_247} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] [2022-12-13 01:37:11,126 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L40-1-->L51-1: Formula: (and (< v_~j1~0_396 (+ v_~m~0_243 1)) (< v_~i1~0_307 v_~n~0_205) (= v_~k2~0_261 (+ v_~k2~0_262 v_~m~0_243)) (= v_~i2~0_262 (+ v_~i2~0_263 1)) (= v_~k1~0_366 (+ v_~k1~0_367 8)) (= 8 v_~j1~0_396) (< v_~i2~0_263 v_~n~0_205)) InVars {~m~0=v_~m~0_243, ~k2~0=v_~k2~0_262, ~k1~0=v_~k1~0_367, ~i2~0=v_~i2~0_263, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_135|, ~m~0=v_~m~0_243, ~k2~0=v_~k2~0_261, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_202|, ~k1~0=v_~k1~0_366, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_204|, ~i2~0=v_~i2~0_262, ~j1~0=v_~j1~0_396, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [509] L41-6-->L41-6: Formula: (and (<= v_~m~0_289 (+ v_~j1~0_475 1)) (= v_~k1~0_426 (+ v_~k1~0_427 1)) (= (+ v_~i1~0_375 1) v_~i1~0_374) (< v_~i1~0_374 v_~n~0_249) (< v_~j1~0_475 v_~m~0_289) (= v_~j1~0_473 0)) InVars {~m~0=v_~m~0_289, ~k1~0=v_~k1~0_427, ~j1~0=v_~j1~0_475, ~i1~0=v_~i1~0_375, ~n~0=v_~n~0_249} OutVars{~m~0=v_~m~0_289, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_235|, ~k1~0=v_~k1~0_426, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_237|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_156|, ~j1~0=v_~j1~0_473, ~i1~0=v_~i1~0_374, ~n~0=v_~n~0_249} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-13 01:37:11,235 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L40-1-->L51-1: Formula: (and (< v_~j1~0_396 (+ v_~m~0_243 1)) (< v_~i1~0_307 v_~n~0_205) (= v_~k2~0_261 (+ v_~k2~0_262 v_~m~0_243)) (= v_~i2~0_262 (+ v_~i2~0_263 1)) (= v_~k1~0_366 (+ v_~k1~0_367 8)) (= 8 v_~j1~0_396) (< v_~i2~0_263 v_~n~0_205)) InVars {~m~0=v_~m~0_243, ~k2~0=v_~k2~0_262, ~k1~0=v_~k1~0_367, ~i2~0=v_~i2~0_263, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_135|, ~m~0=v_~m~0_243, ~k2~0=v_~k2~0_261, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_202|, ~k1~0=v_~k1~0_366, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_204|, ~i2~0=v_~i2~0_262, ~j1~0=v_~j1~0_396, ~i1~0=v_~i1~0_307, ~n~0=v_~n~0_205} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [510] L41-6-->L51-1: Formula: (and (< v_~i2~0_326 v_~n~0_251) (= (+ v_~k1~0_431 1) v_~k1~0_430) (< v_~j1~0_480 v_~m~0_291) (not (< v_~j1~0_479 v_~m~0_291)) (= v_~i1~0_378 (+ v_~i1~0_379 1)) (= v_~j1~0_479 (+ v_~j1~0_480 1)) (= (+ v_~k2~0_326 v_~m~0_291) v_~k2~0_325) (= (+ v_~i2~0_326 1) v_~i2~0_325)) InVars {~m~0=v_~m~0_291, ~k2~0=v_~k2~0_326, ~k1~0=v_~k1~0_431, ~i2~0=v_~i2~0_326, ~j1~0=v_~j1~0_480, ~i1~0=v_~i1~0_379, ~n~0=v_~n~0_251} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_171|, ~m~0=v_~m~0_291, ~k2~0=v_~k2~0_325, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_237|, ~k1~0=v_~k1~0_430, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_239|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_158|, ~i2~0=v_~i2~0_325, ~j1~0=v_~j1~0_479, ~i1~0=v_~i1~0_378, ~n~0=v_~n~0_251} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~0] [2022-12-13 01:37:11,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] L40-1-->L41-6: Formula: (and (< v_~i2~0_234 v_~n~0_175) (= v_~k2~0_234 (+ v_~k2~0_235 v_~m~0_213)) (= (+ v_~i2~0_234 1) v_~i2~0_233) (< v_~i1~0_253 v_~n~0_175) (= (+ v_~i1~0_254 1) v_~i1~0_253) (<= v_~m~0_213 3) (< 2 v_~m~0_213) (= 2 v_~j1~0_344) (= v_~k1~0_328 (+ v_~k1~0_330 5))) InVars {~m~0=v_~m~0_213, ~k1~0=v_~k1~0_330, ~k2~0=v_~k2~0_235, ~i2~0=v_~i2~0_234, ~i1~0=v_~i1~0_254, ~n~0=v_~n~0_175} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_119|, ~m~0=v_~m~0_213, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_178|, ~k1~0=v_~k1~0_328, ~k2~0=v_~k2~0_234, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_180|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_103|, ~j1~0=v_~j1~0_344, ~i2~0=v_~i2~0_233, ~i1~0=v_~i1~0_253, ~n~0=v_~n~0_175} 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-13 01:37:11,588 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 01:37:11,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2928 [2022-12-13 01:37:11,589 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 1376 transitions, 33426 flow [2022-12-13 01:37:11,589 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-13 01:37:11,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:37:11,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:37:11,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 01:37:11,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:37:11,795 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:37:11,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:37:11,795 INFO L85 PathProgramCache]: Analyzing trace with hash 624839578, now seen corresponding path program 1 times [2022-12-13 01:37:11,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:37:11,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822817086] [2022-12-13 01:37:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:37:11,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:37:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:37:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:37:11,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:37:11,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822817086] [2022-12-13 01:37:11,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822817086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:37:11,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:37:11,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:37:11,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970329363] [2022-12-13 01:37:11,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:37:11,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:37:11,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:37:11,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:37:11,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:37:11,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 99 [2022-12-13 01:37:11,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 1376 transitions, 33426 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-13 01:37:11,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:37:11,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 99 [2022-12-13 01:37:11,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:37:15,528 INFO L130 PetriNetUnfolder]: 5102/8885 cut-off events. [2022-12-13 01:37:15,528 INFO L131 PetriNetUnfolder]: For 220313/220313 co-relation queries the response was YES. [2022-12-13 01:37:15,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89356 conditions, 8885 events. 5102/8885 cut-off events. For 220313/220313 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 63729 event pairs, 485 based on Foata normal form. 94/8949 useless extension candidates. Maximal degree in co-relation 88032. Up to 3468 conditions per place. [2022-12-13 01:37:15,610 INFO L137 encePairwiseOnDemand]: 51/99 looper letters, 939 selfloop transitions, 603 changer transitions 11/1553 dead transitions. [2022-12-13 01:37:15,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1553 transitions, 39484 flow [2022-12-13 01:37:15,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:37:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:37:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-12-13 01:37:15,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18614718614718614 [2022-12-13 01:37:15,612 INFO L175 Difference]: Start difference. First operand has 224 places, 1376 transitions, 33426 flow. Second operand 7 states and 129 transitions. [2022-12-13 01:37:15,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 1553 transitions, 39484 flow [2022-12-13 01:37:17,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 1553 transitions, 38747 flow, removed 317 selfloop flow, removed 5 redundant places. [2022-12-13 01:37:17,706 INFO L231 Difference]: Finished difference. Result has 229 places, 1354 transitions, 34706 flow [2022-12-13 01:37:17,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=31376, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=566, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=34706, PETRI_PLACES=229, PETRI_TRANSITIONS=1354} [2022-12-13 01:37:17,708 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 210 predicate places. [2022-12-13 01:37:17,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:37:17,708 INFO L89 Accepts]: Start accepts. Operand has 229 places, 1354 transitions, 34706 flow [2022-12-13 01:37:17,714 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:37:17,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:37:17,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 1354 transitions, 34706 flow [2022-12-13 01:37:17,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 1354 transitions, 34706 flow [2022-12-13 01:37:18,509 INFO L130 PetriNetUnfolder]: 1690/3219 cut-off events. [2022-12-13 01:37:18,509 INFO L131 PetriNetUnfolder]: For 104882/105816 co-relation queries the response was YES. [2022-12-13 01:37:18,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37360 conditions, 3219 events. 1690/3219 cut-off events. For 104882/105816 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 21992 event pairs, 16 based on Foata normal form. 10/3219 useless extension candidates. Maximal degree in co-relation 36909. Up to 1571 conditions per place. [2022-12-13 01:37:18,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 1354 transitions, 34706 flow [2022-12-13 01:37:18,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 3024 [2022-12-13 01:37:18,570 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [520] L40-1-->L41-6: Formula: (and (= v_~i2~0_367 (+ v_~i2~0_368 1)) (< 8 v_~m~0_311) (= v_~k2~0_367 (+ v_~k2~0_368 v_~m~0_311)) (< v_~i1~0_408 v_~n~0_269) (= v_~k1~0_480 (+ v_~k1~0_482 9)) (< v_~i2~0_368 v_~n~0_269) (<= v_~m~0_311 9) (= v_~i1~0_408 (+ v_~i1~0_409 1)) (= v_~j1~0_515 0)) InVars {~m~0=v_~m~0_311, ~k1~0=v_~k1~0_482, ~k2~0=v_~k2~0_368, ~i2~0=v_~i2~0_368, ~i1~0=v_~i1~0_409, ~n~0=v_~n~0_269} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_195|, ~m~0=v_~m~0_311, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_267|, ~k1~0=v_~k1~0_480, ~k2~0=v_~k2~0_367, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_269|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_170|, ~j1~0=v_~j1~0_515, ~i2~0=v_~i2~0_367, ~i1~0=v_~i1~0_408, ~n~0=v_~n~0_269} 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-13 01:37:18,792 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-13 01:37:18,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L41-6-->L41-6: Formula: (and (= v_~i1~0_329 (+ v_~i1~0_330 1)) (= v_~j1~0_426 0) (< v_~i1~0_329 v_~n~0_227) (not (< v_~j1~0_427 v_~m~0_265))) InVars {~m~0=v_~m~0_265, ~j1~0=v_~j1~0_427, ~i1~0=v_~i1~0_330, ~n~0=v_~n~0_227} OutVars{~m~0=v_~m~0_265, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_132|, ~j1~0=v_~j1~0_426, ~i1~0=v_~i1~0_329, ~n~0=v_~n~0_227} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] and [493] L51-1-->L51-1: Formula: (and (= v_~k2~0_283 (+ v_~k2~0_285 (* 2 v_~m~0_257))) (< (+ v_~i2~0_286 1) v_~n~0_219) (= v_~i2~0_284 (+ 2 v_~i2~0_286))) InVars {~m~0=v_~m~0_257, ~k2~0=v_~k2~0_285, ~i2~0=v_~i2~0_286, ~n~0=v_~n~0_219} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_147|, ~m~0=v_~m~0_257, ~k2~0=v_~k2~0_283, ~i2~0=v_~i2~0_284, ~n~0=v_~n~0_219} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-13 01:37:19,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L41-6-->L41-6: Formula: (and (= v_~i1~0_329 (+ v_~i1~0_330 1)) (= v_~j1~0_426 0) (< v_~i1~0_329 v_~n~0_227) (not (< v_~j1~0_427 v_~m~0_265))) InVars {~m~0=v_~m~0_265, ~j1~0=v_~j1~0_427, ~i1~0=v_~i1~0_330, ~n~0=v_~n~0_227} OutVars{~m~0=v_~m~0_265, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_132|, ~j1~0=v_~j1~0_426, ~i1~0=v_~i1~0_329, ~n~0=v_~n~0_227} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] and [494] L51-1-->L41-6: Formula: (and (= v_~k2~0_289 (+ v_~k2~0_290 v_~m~0_259)) (< v_~j1~0_417 v_~m~0_259) (< v_~i2~0_291 v_~n~0_221) (= v_~k1~0_386 (+ v_~k1~0_387 1)) (= v_~j1~0_416 (+ v_~j1~0_417 1)) (= (+ v_~i2~0_291 1) v_~i2~0_290)) InVars {~m~0=v_~m~0_259, ~k1~0=v_~k1~0_387, ~k2~0=v_~k2~0_290, ~j1~0=v_~j1~0_417, ~i2~0=v_~i2~0_291, ~n~0=v_~n~0_221} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_151|, ~m~0=v_~m~0_259, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_212|, ~k1~0=v_~k1~0_386, ~k2~0=v_~k2~0_289, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_214|, ~j1~0=v_~j1~0_416, ~i2~0=v_~i2~0_290, ~n~0=v_~n~0_221} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, ~k1~0, ~k2~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0, ~i2~0] [2022-12-13 01:37:19,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L51-1-->L41-6: Formula: (and (< v_~i2~0_95 v_~n~0_79) (= v_~k2~0_95 (+ v_~m~0_89 v_~k2~0_96)) (< v_~i1~0_108 v_~n~0_79) (= v_~j1~0_106 0) (= v_~i2~0_94 (+ v_~i2~0_95 1))) InVars {~m~0=v_~m~0_89, ~k2~0=v_~k2~0_96, ~i2~0=v_~i2~0_95, ~i1~0=v_~i1~0_108, ~n~0=v_~n~0_79} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_37|, ~m~0=v_~m~0_89, ~k2~0=v_~k2~0_95, ~j1~0=v_~j1~0_106, ~i2~0=v_~i2~0_94, ~i1~0=v_~i1~0_108, ~n~0=v_~n~0_79} 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-13 01:37:19,343 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] L41-6-->L41-6: Formula: (and (not (< v_~j1~0_211 v_~m~0_159)) (< v_~i1~0_203 v_~n~0_147) (= (+ v_~i1~0_204 1) v_~i1~0_203) (= v_~j1~0_210 0)) InVars {~m~0=v_~m~0_159, ~j1~0=v_~j1~0_211, ~i1~0=v_~i1~0_204, ~n~0=v_~n~0_147} OutVars{~m~0=v_~m~0_159, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_79|, ~j1~0=v_~j1~0_210, ~i1~0=v_~i1~0_203, ~n~0=v_~n~0_147} 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-13 01:37:19,490 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [468] L41-6-->L41-6: Formula: (and (not (< v_~j1~0_334 v_~m~0_207)) (< v_~i1~0_240 v_~n~0_169) (= v_~i1~0_240 (+ v_~i1~0_241 1)) (= v_~j1~0_333 0)) InVars {~m~0=v_~m~0_207, ~j1~0=v_~j1~0_334, ~i1~0=v_~i1~0_241, ~n~0=v_~n~0_169} OutVars{~m~0=v_~m~0_207, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_95|, ~j1~0=v_~j1~0_333, ~i1~0=v_~i1~0_240, ~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-13 01:37:19,543 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 01:37:19,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1836 [2022-12-13 01:37:19,544 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 1351 transitions, 34869 flow [2022-12-13 01:37:19,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-13 01:37:19,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:37:19,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:37:19,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 01:37:19,545 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:37:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:37:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 925868705, now seen corresponding path program 1 times [2022-12-13 01:37:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:37:19,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17080359] [2022-12-13 01:37:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:37:19,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:37:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:37:19,798 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-13 01:37:19,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:37:19,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17080359] [2022-12-13 01:37:19,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17080359] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:37:19,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208253276] [2022-12-13 01:37:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:37:19,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:37:19,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:37:19,800 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:37:19,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 01:37:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:37:19,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 01:37:19,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:37:20,153 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-13 01:37:20,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:37:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:37:20,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208253276] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:37:20,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:37:20,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2022-12-13 01:37:20,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38825737] [2022-12-13 01:37:20,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:37:20,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 01:37:20,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:37:20,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 01:37:20,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-12-13 01:37:20,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 101 [2022-12-13 01:37:20,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 1351 transitions, 34869 flow. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:37:20,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:37:20,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 101 [2022-12-13 01:37:20,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:37:27,274 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 [] [2022-12-13 01:37:31,581 INFO L130 PetriNetUnfolder]: 5559/8841 cut-off events. [2022-12-13 01:37:31,581 INFO L131 PetriNetUnfolder]: For 252824/252824 co-relation queries the response was YES. [2022-12-13 01:37:31,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100208 conditions, 8841 events. 5559/8841 cut-off events. For 252824/252824 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 55822 event pairs, 28 based on Foata normal form. 3/8818 useless extension candidates. Maximal degree in co-relation 98585. Up to 5763 conditions per place. [2022-12-13 01:37:31,667 INFO L137 encePairwiseOnDemand]: 14/101 looper letters, 684 selfloop transitions, 965 changer transitions 19/1668 dead transitions. [2022-12-13 01:37:31,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 1668 transitions, 45980 flow [2022-12-13 01:37:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 01:37:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 01:37:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 211 transitions. [2022-12-13 01:37:31,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.09083082221265605 [2022-12-13 01:37:31,669 INFO L175 Difference]: Start difference. First operand has 219 places, 1351 transitions, 34869 flow. Second operand 23 states and 211 transitions. [2022-12-13 01:37:31,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 1668 transitions, 45980 flow [2022-12-13 01:37:34,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 1668 transitions, 44484 flow, removed 748 selfloop flow, removed 0 redundant places. [2022-12-13 01:37:34,800 INFO L231 Difference]: Finished difference. Result has 251 places, 1601 transitions, 44614 flow [2022-12-13 01:37:34,800 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=33699, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=740, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=44614, PETRI_PLACES=251, PETRI_TRANSITIONS=1601} [2022-12-13 01:37:34,801 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 232 predicate places. [2022-12-13 01:37:34,801 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:37:34,801 INFO L89 Accepts]: Start accepts. Operand has 251 places, 1601 transitions, 44614 flow [2022-12-13 01:37:34,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:37:34,806 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:37:34,806 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 1601 transitions, 44614 flow [2022-12-13 01:37:34,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 1601 transitions, 44614 flow [2022-12-13 01:37:35,745 INFO L130 PetriNetUnfolder]: 1936/3625 cut-off events. [2022-12-13 01:37:35,745 INFO L131 PetriNetUnfolder]: For 143360/147000 co-relation queries the response was YES. [2022-12-13 01:37:35,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46386 conditions, 3625 events. 1936/3625 cut-off events. For 143360/147000 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 24738 event pairs, 11 based on Foata normal form. 6/3621 useless extension candidates. Maximal degree in co-relation 45923. Up to 1889 conditions per place. [2022-12-13 01:37:35,807 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 1601 transitions, 44614 flow [2022-12-13 01:37:35,807 INFO L226 LiptonReduction]: Number of co-enabled transitions 3544 [2022-12-13 01:37:35,933 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] L40-1-->L51-1: Formula: (and (= (+ v_~k2~0_389 (* 2 v_~m~0_319)) v_~k2~0_387) (< v_~i2~0_387 (+ v_~n~0_277 1)) (< v_~i1~0_424 v_~n~0_277) (= v_~j1~0_529 0) (= v_~k1~0_502 (+ v_~k1~0_503 9)) (= v_~i1~0_424 (+ v_~i1~0_425 1)) (< 8 v_~m~0_319) (<= v_~m~0_319 9) (= (+ 2 v_~i2~0_389) v_~i2~0_387)) InVars {~m~0=v_~m~0_319, ~k2~0=v_~k2~0_389, ~k1~0=v_~k1~0_503, ~i2~0=v_~i2~0_389, ~i1~0=v_~i1~0_425, ~n~0=v_~n~0_277} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_207|, ~m~0=v_~m~0_319, ~k2~0=v_~k2~0_387, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_281|, ~k1~0=v_~k1~0_502, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_283|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_178|, ~i2~0=v_~i2~0_387, ~j1~0=v_~j1~0_529, ~i1~0=v_~i1~0_424, ~n~0=v_~n~0_277} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~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-13 01:37:36,050 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [526] L40-1-->L41-6: Formula: (and (= v_~j1~0_531 1) (< 8 v_~m~0_321) (= v_~i2~0_393 (+ v_~i2~0_394 1)) (= v_~k2~0_393 (+ v_~k2~0_394 v_~m~0_321)) (< v_~i2~0_394 v_~n~0_279) (= v_~k1~0_506 (+ v_~k1~0_508 10)) (= v_~i1~0_428 (+ v_~i1~0_429 1)) (< v_~i1~0_428 v_~n~0_279) (<= v_~m~0_321 9)) InVars {~m~0=v_~m~0_321, ~k1~0=v_~k1~0_508, ~k2~0=v_~k2~0_394, ~i2~0=v_~i2~0_394, ~i1~0=v_~i1~0_429, ~n~0=v_~n~0_279} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_211|, ~m~0=v_~m~0_321, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_283|, ~k1~0=v_~k1~0_506, ~k2~0=v_~k2~0_393, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_285|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_180|, ~j1~0=v_~j1~0_531, ~i2~0=v_~i2~0_393, ~i1~0=v_~i1~0_428, ~n~0=v_~n~0_279} 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-13 01:37:36,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [504] L40-1-->L41-6: Formula: (and (= v_~j1~0_453 1) (< v_~i1~0_358 v_~n~0_241) (<= v_~m~0_279 8) (= v_~k1~0_404 (+ v_~k1~0_406 9)) (< 7 v_~m~0_279) (= v_~i1~0_358 (+ v_~i1~0_359 1))) InVars {~m~0=v_~m~0_279, ~k1~0=v_~k1~0_406, ~i1~0=v_~i1~0_359, ~n~0=v_~n~0_241} OutVars{~m~0=v_~m~0_279, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_223|, ~k1~0=v_~k1~0_404, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_225|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_148|, ~j1~0=v_~j1~0_453, ~i1~0=v_~i1~0_358, ~n~0=v_~n~0_241} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, 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-13 01:37:36,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L40-1-->L41-6: Formula: (and (< v_~j1~0_388 (+ v_~m~0_239 1)) (= 9 v_~j1~0_388) (< v_~i1~0_301 v_~n~0_201) (= v_~k1~0_356 (+ v_~k1~0_358 9))) InVars {~m~0=v_~m~0_239, ~k1~0=v_~k1~0_358, ~i1~0=v_~i1~0_301, ~n~0=v_~n~0_201} OutVars{~m~0=v_~m~0_239, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_196|, ~k1~0=v_~k1~0_356, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_198|, ~j1~0=v_~j1~0_388, ~i1~0=v_~i1~0_301, ~n~0=v_~n~0_201} 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-13 01:37:36,785 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] L40-1-->L40-1: Formula: (and (= v_~k1~0_580 (+ v_~k1~0_581 9)) (< v_~j1~0_614 (+ v_~m~0_361 1)) (< v_~i1~0_498 v_~n~0_315) (= 9 v_~j1~0_614) (not (< v_~j1~0_614 v_~m~0_361)) (= v_~i1~0_497 (+ v_~i1~0_498 1))) InVars {~m~0=v_~m~0_361, ~k1~0=v_~k1~0_581, ~i1~0=v_~i1~0_498, ~n~0=v_~n~0_315} OutVars{~m~0=v_~m~0_361, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_326|, ~k1~0=v_~k1~0_580, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_328|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_214|, ~j1~0=v_~j1~0_614, ~i1~0=v_~i1~0_497, ~n~0=v_~n~0_315} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, 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-13 01:37:36,960 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 01:37:36,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2160 [2022-12-13 01:37:36,961 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 1600 transitions, 44816 flow [2022-12-13 01:37:36,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:37:36,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:37:36,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:37:36,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 01:37:37,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 01:37:37,167 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:37:37,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:37:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1970862862, now seen corresponding path program 1 times [2022-12-13 01:37:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:37:37,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657710166] [2022-12-13 01:37:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:37:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:37:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:37:37,443 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-13 01:37:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:37:37,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657710166] [2022-12-13 01:37:37,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657710166] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:37:37,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106402207] [2022-12-13 01:37:37,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:37:37,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:37:37,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:37:37,445 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:37:37,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 01:37:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:37:37,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 01:37:37,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:37:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:37:37,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:37:38,342 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-13 01:37:38,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106402207] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:37:38,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:37:38,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 9 [2022-12-13 01:37:38,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336953555] [2022-12-13 01:37:38,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:37:38,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:37:38,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:37:38,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:37:38,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:37:38,343 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 106 [2022-12-13 01:37:38,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 1600 transitions, 44816 flow. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:37:38,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:37:38,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 106 [2022-12-13 01:37:38,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:37:43,459 INFO L130 PetriNetUnfolder]: 5822/9251 cut-off events. [2022-12-13 01:37:43,459 INFO L131 PetriNetUnfolder]: For 292394/292394 co-relation queries the response was YES. [2022-12-13 01:37:43,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112627 conditions, 9251 events. 5822/9251 cut-off events. For 292394/292394 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 58615 event pairs, 56 based on Foata normal form. 4/9227 useless extension candidates. Maximal degree in co-relation 111744. Up to 6574 conditions per place. [2022-12-13 01:37:43,561 INFO L137 encePairwiseOnDemand]: 14/106 looper letters, 845 selfloop transitions, 903 changer transitions 21/1769 dead transitions. [2022-12-13 01:37:43,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 1769 transitions, 52781 flow [2022-12-13 01:37:43,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 01:37:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 01:37:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 189 transitions. [2022-12-13 01:37:43,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11143867924528301 [2022-12-13 01:37:43,563 INFO L175 Difference]: Start difference. First operand has 245 places, 1600 transitions, 44816 flow. Second operand 16 states and 189 transitions. [2022-12-13 01:37:43,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 1769 transitions, 52781 flow [2022-12-13 01:37:47,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 1769 transitions, 51618 flow, removed 515 selfloop flow, removed 5 redundant places. [2022-12-13 01:37:47,460 INFO L231 Difference]: Finished difference. Result has 261 places, 1710 transitions, 50318 flow [2022-12-13 01:37:47,461 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=43794, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=799, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=755, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=50318, PETRI_PLACES=261, PETRI_TRANSITIONS=1710} [2022-12-13 01:37:47,462 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 242 predicate places. [2022-12-13 01:37:47,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:37:47,462 INFO L89 Accepts]: Start accepts. Operand has 261 places, 1710 transitions, 50318 flow [2022-12-13 01:37:47,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:37:47,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:37:47,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 1710 transitions, 50318 flow [2022-12-13 01:37:47,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 1710 transitions, 50318 flow [2022-12-13 01:37:48,599 INFO L130 PetriNetUnfolder]: 2027/3782 cut-off events. [2022-12-13 01:37:48,599 INFO L131 PetriNetUnfolder]: For 163512/169170 co-relation queries the response was YES. [2022-12-13 01:37:48,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50886 conditions, 3782 events. 2027/3782 cut-off events. For 163512/169170 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25828 event pairs, 10 based on Foata normal form. 5/3778 useless extension candidates. Maximal degree in co-relation 50370. Up to 2011 conditions per place. [2022-12-13 01:37:48,670 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 1710 transitions, 50318 flow [2022-12-13 01:37:48,670 INFO L226 LiptonReduction]: Number of co-enabled transitions 3778 [2022-12-13 01:37:48,683 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-13 01:37:48,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L40-1-->L51-1: Formula: (and (< v_~i1~0_234 v_~n~0_165) (< v_~j1~0_285 (+ v_~m~0_189 1)) (= 7 v_~j1~0_285) (= (+ v_~i2~0_217 1) v_~i2~0_216) (= v_~k1~0_274 (+ v_~k1~0_275 7)) (< v_~i2~0_217 v_~n~0_165) (= (+ v_~k2~0_219 v_~m~0_189) v_~k2~0_218)) InVars {~m~0=v_~m~0_189, ~k2~0=v_~k2~0_219, ~k1~0=v_~k1~0_275, ~i2~0=v_~i2~0_217, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_109|, ~m~0=v_~m~0_189, ~k2~0=v_~k2~0_218, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_143|, ~k1~0=v_~k1~0_274, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_145|, ~i2~0=v_~i2~0_216, ~j1~0=v_~j1~0_285, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [538] L41-6-->L41-6: Formula: (and (= v_~j1~0_583 1) (< v_~i1~0_464 v_~n~0_299) (not (< v_~j1~0_585 v_~m~0_345)) (= (+ v_~i1~0_465 1) v_~i1~0_464) (= v_~k1~0_542 (+ v_~k1~0_543 1)) (< v_~j1~0_583 (+ v_~m~0_345 1))) InVars {~m~0=v_~m~0_345, ~k1~0=v_~k1~0_543, ~j1~0=v_~j1~0_585, ~i1~0=v_~i1~0_465, ~n~0=v_~n~0_299} OutVars{~m~0=v_~m~0_345, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_303|, ~k1~0=v_~k1~0_542, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_305|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_196|, ~j1~0=v_~j1~0_583, ~i1~0=v_~i1~0_464, ~n~0=v_~n~0_299} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-13 01:37:48,867 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L40-1-->L51-1: Formula: (and (< v_~i1~0_234 v_~n~0_165) (< v_~j1~0_285 (+ v_~m~0_189 1)) (= 7 v_~j1~0_285) (= (+ v_~i2~0_217 1) v_~i2~0_216) (= v_~k1~0_274 (+ v_~k1~0_275 7)) (< v_~i2~0_217 v_~n~0_165) (= (+ v_~k2~0_219 v_~m~0_189) v_~k2~0_218)) InVars {~m~0=v_~m~0_189, ~k2~0=v_~k2~0_219, ~k1~0=v_~k1~0_275, ~i2~0=v_~i2~0_217, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_109|, ~m~0=v_~m~0_189, ~k2~0=v_~k2~0_218, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_143|, ~k1~0=v_~k1~0_274, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_145|, ~i2~0=v_~i2~0_216, ~j1~0=v_~j1~0_285, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [529] L41-6-->L40-1: Formula: (and (= v_~k1~0_522 (+ v_~k1~0_523 1)) (= (+ v_~j1~0_546 1) v_~j1~0_545) (< v_~j1~0_546 v_~m~0_327) (= v_~i1~0_432 (+ v_~i1~0_433 1)) (not (< v_~j1~0_545 v_~m~0_327))) InVars {~m~0=v_~m~0_327, ~k1~0=v_~k1~0_523, ~j1~0=v_~j1~0_546, ~i1~0=v_~i1~0_433} OutVars{~m~0=v_~m~0_327, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_293|, ~k1~0=v_~k1~0_522, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_295|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_182|, ~j1~0=v_~j1~0_545, ~i1~0=v_~i1~0_432} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-13 01:37:48,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L40-1-->L51-1: Formula: (and (< v_~i1~0_234 v_~n~0_165) (< v_~j1~0_285 (+ v_~m~0_189 1)) (= 7 v_~j1~0_285) (= (+ v_~i2~0_217 1) v_~i2~0_216) (= v_~k1~0_274 (+ v_~k1~0_275 7)) (< v_~i2~0_217 v_~n~0_165) (= (+ v_~k2~0_219 v_~m~0_189) v_~k2~0_218)) InVars {~m~0=v_~m~0_189, ~k2~0=v_~k2~0_219, ~k1~0=v_~k1~0_275, ~i2~0=v_~i2~0_217, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_109|, ~m~0=v_~m~0_189, ~k2~0=v_~k2~0_218, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_143|, ~k1~0=v_~k1~0_274, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_145|, ~i2~0=v_~i2~0_216, ~j1~0=v_~j1~0_285, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [539] L41-6-->L51-1: Formula: (and (< v_~i2~0_428 v_~n~0_301) (= v_~i2~0_427 (+ v_~i2~0_428 1)) (= v_~j1~0_589 0) (< v_~i1~0_468 v_~n~0_301) (not (< v_~j1~0_590 v_~m~0_347)) (= v_~i1~0_468 (+ v_~i1~0_469 1)) (= v_~k2~0_427 (+ v_~k2~0_428 v_~m~0_347))) InVars {~m~0=v_~m~0_347, ~k2~0=v_~k2~0_428, ~i2~0=v_~i2~0_428, ~j1~0=v_~j1~0_590, ~i1~0=v_~i1~0_469, ~n~0=v_~n~0_301} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_229|, ~m~0=v_~m~0_347, ~k2~0=v_~k2~0_427, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_198|, ~i2~0=v_~i2~0_427, ~j1~0=v_~j1~0_589, ~i1~0=v_~i1~0_468, ~n~0=v_~n~0_301} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~0] [2022-12-13 01:37:49,083 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L40-1-->L51-1: Formula: (and (< v_~i1~0_234 v_~n~0_165) (< v_~j1~0_285 (+ v_~m~0_189 1)) (= 7 v_~j1~0_285) (= (+ v_~i2~0_217 1) v_~i2~0_216) (= v_~k1~0_274 (+ v_~k1~0_275 7)) (< v_~i2~0_217 v_~n~0_165) (= (+ v_~k2~0_219 v_~m~0_189) v_~k2~0_218)) InVars {~m~0=v_~m~0_189, ~k2~0=v_~k2~0_219, ~k1~0=v_~k1~0_275, ~i2~0=v_~i2~0_217, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_109|, ~m~0=v_~m~0_189, ~k2~0=v_~k2~0_218, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_143|, ~k1~0=v_~k1~0_274, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_145|, ~i2~0=v_~i2~0_216, ~j1~0=v_~j1~0_285, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [528] L41-6-->L41-6: Formula: (and (= v_~k1~0_516 (+ v_~k1~0_518 2)) (= (+ 2 v_~j1~0_541) v_~j1~0_539) (< v_~j1~0_539 (+ v_~m~0_325 1))) InVars {~m~0=v_~m~0_325, ~k1~0=v_~k1~0_518, ~j1~0=v_~j1~0_541} OutVars{~m~0=v_~m~0_325, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_289|, ~k1~0=v_~k1~0_516, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_291|, ~j1~0=v_~j1~0_539} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] [2022-12-13 01:37:49,159 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L40-1-->L51-1: Formula: (and (< v_~i1~0_234 v_~n~0_165) (< v_~j1~0_285 (+ v_~m~0_189 1)) (= 7 v_~j1~0_285) (= (+ v_~i2~0_217 1) v_~i2~0_216) (= v_~k1~0_274 (+ v_~k1~0_275 7)) (< v_~i2~0_217 v_~n~0_165) (= (+ v_~k2~0_219 v_~m~0_189) v_~k2~0_218)) InVars {~m~0=v_~m~0_189, ~k2~0=v_~k2~0_219, ~k1~0=v_~k1~0_275, ~i2~0=v_~i2~0_217, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_109|, ~m~0=v_~m~0_189, ~k2~0=v_~k2~0_218, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_143|, ~k1~0=v_~k1~0_274, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_145|, ~i2~0=v_~i2~0_216, ~j1~0=v_~j1~0_285, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [469] L41-6-->L51-1: Formula: (and (= v_~i1~0_244 (+ v_~i1~0_245 1)) (= v_~k2~0_222 (+ v_~k2~0_223 v_~m~0_209)) (< v_~i2~0_223 v_~n~0_171) (not (< v_~j1~0_337 v_~m~0_209)) (= v_~i2~0_222 (+ v_~i2~0_223 1))) InVars {~m~0=v_~m~0_209, ~k2~0=v_~k2~0_223, ~i2~0=v_~i2~0_223, ~j1~0=v_~j1~0_337, ~i1~0=v_~i1~0_245, ~n~0=v_~n~0_171} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_111|, ~m~0=v_~m~0_209, ~k2~0=v_~k2~0_222, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_97|, ~i2~0=v_~i2~0_222, ~j1~0=v_~j1~0_337, ~i1~0=v_~i1~0_244, ~n~0=v_~n~0_171} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0] [2022-12-13 01:37:49,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L40-1-->L51-1: Formula: (and (< v_~i1~0_234 v_~n~0_165) (< v_~j1~0_285 (+ v_~m~0_189 1)) (= 7 v_~j1~0_285) (= (+ v_~i2~0_217 1) v_~i2~0_216) (= v_~k1~0_274 (+ v_~k1~0_275 7)) (< v_~i2~0_217 v_~n~0_165) (= (+ v_~k2~0_219 v_~m~0_189) v_~k2~0_218)) InVars {~m~0=v_~m~0_189, ~k2~0=v_~k2~0_219, ~k1~0=v_~k1~0_275, ~i2~0=v_~i2~0_217, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_109|, ~m~0=v_~m~0_189, ~k2~0=v_~k2~0_218, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_143|, ~k1~0=v_~k1~0_274, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_145|, ~i2~0=v_~i2~0_216, ~j1~0=v_~j1~0_285, ~i1~0=v_~i1~0_234, ~n~0=v_~n~0_165} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [527] L41-6-->L51-1: Formula: (and (= v_~k2~0_397 (+ v_~k2~0_398 v_~m~0_323)) (= (+ v_~j1~0_536 1) v_~j1~0_535) (< v_~j1~0_536 v_~m~0_323) (< v_~i2~0_398 v_~n~0_281) (= v_~i2~0_397 (+ v_~i2~0_398 1)) (= v_~k1~0_512 (+ v_~k1~0_513 1))) InVars {~m~0=v_~m~0_323, ~k2~0=v_~k2~0_398, ~k1~0=v_~k1~0_513, ~i2~0=v_~i2~0_398, ~j1~0=v_~j1~0_536, ~n~0=v_~n~0_281} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_213|, ~m~0=v_~m~0_323, ~k2~0=v_~k2~0_397, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_287|, ~k1~0=v_~k1~0_512, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_289|, ~i2~0=v_~i2~0_397, ~j1~0=v_~j1~0_535, ~n~0=v_~n~0_281} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] [2022-12-13 01:37:49,564 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:37:49,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2103 [2022-12-13 01:37:49,565 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 1709 transitions, 50438 flow [2022-12-13 01:37:49,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:37:49,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:37:49,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:37:49,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 01:37:49,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:37:49,766 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:37:49,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:37:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash -596149970, now seen corresponding path program 1 times [2022-12-13 01:37:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:37:49,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947367499] [2022-12-13 01:37:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:37:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:37:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:37:50,046 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-13 01:37:50,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:37:50,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947367499] [2022-12-13 01:37:50,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947367499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:37:50,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320434478] [2022-12-13 01:37:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:37:50,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:37:50,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:37:50,048 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:37:50,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 01:37:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:37:50,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 01:37:50,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:37:50,456 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-13 01:37:50,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:37:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:37:50,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320434478] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:37:50,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:37:50,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2022-12-13 01:37:50,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599112629] [2022-12-13 01:37:50,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:37:50,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 01:37:50,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:37:50,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 01:37:50,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-12-13 01:37:50,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 104 [2022-12-13 01:37:50,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 1709 transitions, 50438 flow. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:37:50,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:37:50,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 104 [2022-12-13 01:37:50,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:37:53,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:37:58,183 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 [] [2022-12-13 01:38:08,314 INFO L130 PetriNetUnfolder]: 6573/10420 cut-off events. [2022-12-13 01:38:08,314 INFO L131 PetriNetUnfolder]: For 364359/364359 co-relation queries the response was YES. [2022-12-13 01:38:08,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134336 conditions, 10420 events. 6573/10420 cut-off events. For 364359/364359 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 66995 event pairs, 30 based on Foata normal form. 2/10398 useless extension candidates. Maximal degree in co-relation 132824. Up to 8707 conditions per place. [2022-12-13 01:38:08,447 INFO L137 encePairwiseOnDemand]: 15/104 looper letters, 1458 selfloop transitions, 596 changer transitions 22/2076 dead transitions. [2022-12-13 01:38:08,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 2076 transitions, 64900 flow [2022-12-13 01:38:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 01:38:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 01:38:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 259 transitions. [2022-12-13 01:38:08,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.09578402366863906 [2022-12-13 01:38:08,449 INFO L175 Difference]: Start difference. First operand has 256 places, 1709 transitions, 50438 flow. Second operand 26 states and 259 transitions. [2022-12-13 01:38:08,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 2076 transitions, 64900 flow [2022-12-13 01:38:13,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 2076 transitions, 63851 flow, removed 433 selfloop flow, removed 6 redundant places. [2022-12-13 01:38:13,628 INFO L231 Difference]: Finished difference. Result has 285 places, 1952 transitions, 59867 flow [2022-12-13 01:38:13,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=49522, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=394, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=59867, PETRI_PLACES=285, PETRI_TRANSITIONS=1952} [2022-12-13 01:38:13,629 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 266 predicate places. [2022-12-13 01:38:13,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:38:13,629 INFO L89 Accepts]: Start accepts. Operand has 285 places, 1952 transitions, 59867 flow [2022-12-13 01:38:13,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:38:13,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:38:13,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 1952 transitions, 59867 flow [2022-12-13 01:38:13,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 283 places, 1952 transitions, 59867 flow [2022-12-13 01:38:15,046 INFO L130 PetriNetUnfolder]: 2294/4269 cut-off events. [2022-12-13 01:38:15,047 INFO L131 PetriNetUnfolder]: For 201931/207992 co-relation queries the response was YES. [2022-12-13 01:38:15,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60922 conditions, 4269 events. 2294/4269 cut-off events. For 201931/207992 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 29790 event pairs, 12 based on Foata normal form. 4/4264 useless extension candidates. Maximal degree in co-relation 60522. Up to 2377 conditions per place. [2022-12-13 01:38:15,129 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 283 places, 1952 transitions, 59867 flow [2022-12-13 01:38:15,129 INFO L226 LiptonReduction]: Number of co-enabled transitions 4304 [2022-12-13 01:38:15,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:38:15,284 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:38:15,479 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [544] L40-1-->L41-6: Formula: (and (= (+ v_~k2~0_450 v_~m~0_355) v_~k2~0_449) (= (+ v_~i2~0_449 1) v_~i2~0_448) (< v_~i1~0_485 v_~n~0_309) (< v_~i2~0_449 v_~n~0_309) (< 8 v_~m~0_355) (= v_~k1~0_564 (+ v_~k1~0_566 12)) (<= v_~m~0_355 9) (= 3 v_~j1~0_604) (= v_~i1~0_485 (+ v_~i1~0_486 1))) InVars {~m~0=v_~m~0_355, ~k1~0=v_~k1~0_566, ~k2~0=v_~k2~0_450, ~i2~0=v_~i2~0_449, ~i1~0=v_~i1~0_486, ~n~0=v_~n~0_309} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_243|, ~m~0=v_~m~0_355, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_316|, ~k1~0=v_~k1~0_564, ~k2~0=v_~k2~0_449, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_318|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_208|, ~j1~0=v_~j1~0_604, ~i2~0=v_~i2~0_448, ~i1~0=v_~i1~0_485, ~n~0=v_~n~0_309} 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-13 01:38:15,645 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [566] L41-6-->L41-6: Formula: (and (= v_~j1~0_678 0) (< v_~i1~0_557 v_~n~0_351) (= v_~i1~0_557 (+ v_~i1~0_558 1)) (not (< v_~j1~0_679 v_~m~0_397))) InVars {~m~0=v_~m~0_397, ~j1~0=v_~j1~0_679, ~i1~0=v_~i1~0_558, ~n~0=v_~n~0_351} OutVars{~m~0=v_~m~0_397, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_240|, ~j1~0=v_~j1~0_678, ~i1~0=v_~i1~0_557, ~n~0=v_~n~0_351} 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-13 01:38:15,737 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-13 01:38:15,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] L40-1-->L41-6: Formula: (and (< 8 v_~m~0_373) (< v_~i1~0_517 v_~n~0_327) (< v_~i2~0_469 v_~n~0_327) (<= v_~m~0_373 9) (= v_~k1~0_608 (+ v_~k1~0_610 10)) (= (+ v_~i2~0_469 1) v_~i2~0_468) (= v_~j1~0_632 1) (= (+ v_~k2~0_470 v_~m~0_373) v_~k2~0_469) (= v_~i1~0_517 (+ v_~i1~0_518 1))) InVars {~m~0=v_~m~0_373, ~k1~0=v_~k1~0_610, ~k2~0=v_~k2~0_470, ~i2~0=v_~i2~0_469, ~i1~0=v_~i1~0_518, ~n~0=v_~n~0_327} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_253|, ~m~0=v_~m~0_373, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_342|, ~k1~0=v_~k1~0_608, ~k2~0=v_~k2~0_469, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_344|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_222|, ~j1~0=v_~j1~0_632, ~i2~0=v_~i2~0_468, ~i1~0=v_~i1~0_517, ~n~0=v_~n~0_327} 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-13 01:38:16,081 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-13 01:38:16,283 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L40-1-->L41-6: Formula: (and (= v_~j1~0_618 10) (= v_~k1~0_588 (+ v_~k1~0_590 10)) (< v_~i1~0_503 v_~n~0_319) (< v_~j1~0_618 (+ v_~m~0_365 1))) InVars {~m~0=v_~m~0_365, ~k1~0=v_~k1~0_590, ~i1~0=v_~i1~0_503, ~n~0=v_~n~0_319} OutVars{~m~0=v_~m~0_365, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_330|, ~k1~0=v_~k1~0_588, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_332|, ~j1~0=v_~j1~0_618, ~i1~0=v_~i1~0_503, ~n~0=v_~n~0_319} 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-13 01:38:16,332 INFO L241 LiptonReduction]: Total number of compositions: 10 [2022-12-13 01:38:16,333 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2704 [2022-12-13 01:38:16,333 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 1948 transitions, 60145 flow [2022-12-13 01:38:16,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:38:16,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:38:16,333 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:38:16,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 01:38:16,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:38:16,538 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:38:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:38:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash -235141345, now seen corresponding path program 1 times [2022-12-13 01:38:16,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:38:16,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570565837] [2022-12-13 01:38:16,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:38:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:38:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:38:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:38:16,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:38:16,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570565837] [2022-12-13 01:38:16,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570565837] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:38:16,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226401628] [2022-12-13 01:38:16,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:38:16,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:38:16,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:38:16,592 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:38:16,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 01:38:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:38:16,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 01:38:16,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:38:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:38:16,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:38:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:38:16,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226401628] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:38:16,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:38:16,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 01:38:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188064272] [2022-12-13 01:38:16,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:38:16,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:38:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:38:16,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:38:16,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:38:16,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 119 [2022-12-13 01:38:16,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 1948 transitions, 60145 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-13 01:38:16,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:38:16,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 119 [2022-12-13 01:38:16,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:38:22,187 INFO L130 PetriNetUnfolder]: 5727/9276 cut-off events. [2022-12-13 01:38:22,187 INFO L131 PetriNetUnfolder]: For 377697/377697 co-relation queries the response was YES. [2022-12-13 01:38:22,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117046 conditions, 9276 events. 5727/9276 cut-off events. For 377697/377697 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 61051 event pairs, 40 based on Foata normal form. 464/9716 useless extension candidates. Maximal degree in co-relation 116035. Up to 5441 conditions per place. [2022-12-13 01:38:22,384 INFO L137 encePairwiseOnDemand]: 32/119 looper letters, 1286 selfloop transitions, 551 changer transitions 14/1851 dead transitions. [2022-12-13 01:38:22,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1851 transitions, 58419 flow [2022-12-13 01:38:22,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:38:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:38:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2022-12-13 01:38:22,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21428571428571427 [2022-12-13 01:38:22,385 INFO L175 Difference]: Start difference. First operand has 280 places, 1948 transitions, 60145 flow. Second operand 6 states and 153 transitions. [2022-12-13 01:38:22,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 1851 transitions, 58419 flow [2022-12-13 01:38:26,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 1851 transitions, 56701 flow, removed 778 selfloop flow, removed 7 redundant places. [2022-12-13 01:38:26,673 INFO L231 Difference]: Finished difference. Result has 279 places, 1699 transitions, 51344 flow [2022-12-13 01:38:26,674 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=46442, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=456, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1071, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=51344, PETRI_PLACES=279, PETRI_TRANSITIONS=1699} [2022-12-13 01:38:26,675 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 260 predicate places. [2022-12-13 01:38:26,675 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:38:26,675 INFO L89 Accepts]: Start accepts. Operand has 279 places, 1699 transitions, 51344 flow [2022-12-13 01:38:26,686 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:38:26,686 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:38:26,686 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 1699 transitions, 51344 flow [2022-12-13 01:38:26,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 1699 transitions, 51344 flow [2022-12-13 01:38:27,763 INFO L130 PetriNetUnfolder]: 1961/3810 cut-off events. [2022-12-13 01:38:27,763 INFO L131 PetriNetUnfolder]: For 190166/196397 co-relation queries the response was YES. [2022-12-13 01:38:27,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52837 conditions, 3810 events. 1961/3810 cut-off events. For 190166/196397 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 27362 event pairs, 16 based on Foata normal form. 6/3806 useless extension candidates. Maximal degree in co-relation 52334. Up to 2109 conditions per place. [2022-12-13 01:38:27,830 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 1699 transitions, 51344 flow [2022-12-13 01:38:27,830 INFO L226 LiptonReduction]: Number of co-enabled transitions 3728 [2022-12-13 01:38:27,834 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:38:27,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1159 [2022-12-13 01:38:27,835 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 1699 transitions, 51344 flow [2022-12-13 01:38:27,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-13 01:38:27,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:38:27,835 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:38:27,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 01:38:28,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 01:38:28,040 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:38:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:38:28,040 INFO L85 PathProgramCache]: Analyzing trace with hash 793252239, now seen corresponding path program 2 times [2022-12-13 01:38:28,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:38:28,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084810272] [2022-12-13 01:38:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:38:28,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:38:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:38:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:38:28,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:38:28,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084810272] [2022-12-13 01:38:28,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084810272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:38:28,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:38:28,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:38:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064092687] [2022-12-13 01:38:28,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:38:28,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:38:28,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:38:28,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:38:28,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:38:28,105 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 114 [2022-12-13 01:38:28,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 1699 transitions, 51344 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:38:28,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:38:28,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 114 [2022-12-13 01:38:28,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:38:31,468 INFO L130 PetriNetUnfolder]: 4044/6693 cut-off events. [2022-12-13 01:38:31,468 INFO L131 PetriNetUnfolder]: For 280845/280845 co-relation queries the response was YES. [2022-12-13 01:38:31,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89744 conditions, 6693 events. 4044/6693 cut-off events. For 280845/280845 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 43015 event pairs, 725 based on Foata normal form. 280/6945 useless extension candidates. Maximal degree in co-relation 88238. Up to 3659 conditions per place. [2022-12-13 01:38:31,540 INFO L137 encePairwiseOnDemand]: 77/114 looper letters, 640 selfloop transitions, 338 changer transitions 398/1376 dead transitions. [2022-12-13 01:38:31,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 1376 transitions, 45064 flow [2022-12-13 01:38:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:38:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:38:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-12-13 01:38:31,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29605263157894735 [2022-12-13 01:38:31,541 INFO L175 Difference]: Start difference. First operand has 276 places, 1699 transitions, 51344 flow. Second operand 4 states and 135 transitions. [2022-12-13 01:38:31,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 1376 transitions, 45064 flow [2022-12-13 01:38:34,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 1376 transitions, 43216 flow, removed 294 selfloop flow, removed 9 redundant places. [2022-12-13 01:38:34,337 INFO L231 Difference]: Finished difference. Result has 271 places, 943 transitions, 29803 flow [2022-12-13 01:38:34,338 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=38292, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=962, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=29803, PETRI_PLACES=271, PETRI_TRANSITIONS=943} [2022-12-13 01:38:34,338 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 252 predicate places. [2022-12-13 01:38:34,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:38:34,338 INFO L89 Accepts]: Start accepts. Operand has 271 places, 943 transitions, 29803 flow [2022-12-13 01:38:34,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:38:34,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:38:34,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 271 places, 943 transitions, 29803 flow [2022-12-13 01:38:34,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 943 transitions, 29803 flow [2022-12-13 01:38:34,984 INFO L130 PetriNetUnfolder]: 1026/1957 cut-off events. [2022-12-13 01:38:34,984 INFO L131 PetriNetUnfolder]: For 110464/115267 co-relation queries the response was YES. [2022-12-13 01:38:35,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30090 conditions, 1957 events. 1026/1957 cut-off events. For 110464/115267 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12035 event pairs, 15 based on Foata normal form. 1/1946 useless extension candidates. Maximal degree in co-relation 29924. Up to 1354 conditions per place. [2022-12-13 01:38:35,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 943 transitions, 29803 flow [2022-12-13 01:38:35,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 2152 [2022-12-13 01:38:35,031 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] L41-6-->L41-6: Formula: (and (< v_~i1~0_83 v_~n~0_63) (not (< v_~j1~0_84 v_~m~0_73)) (= v_~i1~0_83 (+ v_~i1~0_84 1)) (= v_~j1~0_83 0)) InVars {~m~0=v_~m~0_73, ~j1~0=v_~j1~0_84, ~i1~0=v_~i1~0_84, ~n~0=v_~n~0_63} OutVars{~m~0=v_~m~0_73, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_33|, ~j1~0=v_~j1~0_83, ~i1~0=v_~i1~0_83, ~n~0=v_~n~0_63} 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-13 01:38:35,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] L41-6-->L51-1: Formula: (and (< v_~i1~0_623 v_~n~0_389) (= (+ v_~k2~0_587 v_~m~0_437) v_~k2~0_586) (= (+ v_~i1~0_624 1) v_~i1~0_623) (= v_~j1~0_749 0) (< v_~i2~0_584 v_~n~0_389) (not (< v_~j1~0_750 v_~m~0_437)) (= v_~i2~0_583 (+ v_~i2~0_584 1))) InVars {~m~0=v_~m~0_437, ~k2~0=v_~k2~0_587, ~i2~0=v_~i2~0_584, ~j1~0=v_~j1~0_750, ~i1~0=v_~i1~0_624, ~n~0=v_~n~0_389} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_322|, ~m~0=v_~m~0_437, ~k2~0=v_~k2~0_586, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_272|, ~i2~0=v_~i2~0_583, ~j1~0=v_~j1~0_749, ~i1~0=v_~i1~0_623, ~n~0=v_~n~0_389} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~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-13 01:38:35,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:38:35,645 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [435] L40-1-->L51-1: Formula: (and (not (< v_~j1~0_185 v_~m~0_141)) (= v_~i2~0_173 (+ 2 v_~i2~0_174)) (< (+ v_~i2~0_174 1) v_~n~0_129) (= v_~i1~0_176 (+ v_~i1~0_177 1)) (= 3 v_~j1~0_185) (< v_~i1~0_177 v_~n~0_129) (= (+ v_~k2~0_176 (* 2 v_~m~0_141)) v_~k2~0_175) (= v_~k1~0_168 (+ v_~k1~0_169 3)) (< 2 v_~m~0_141)) InVars {~m~0=v_~m~0_141, ~k2~0=v_~k2~0_176, ~k1~0=v_~k1~0_169, ~i2~0=v_~i2~0_174, ~i1~0=v_~i1~0_177, ~n~0=v_~n~0_129} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_84|, ~m~0=v_~m~0_141, ~k2~0=v_~k2~0_175, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_75|, ~k1~0=v_~k1~0_168, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_77|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_69|, ~i2~0=v_~i2~0_173, ~j1~0=v_~j1~0_185, ~i1~0=v_~i1~0_176, ~n~0=v_~n~0_129} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~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-13 01:38:35,755 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 01:38:35,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1418 [2022-12-13 01:38:35,756 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 943 transitions, 30091 flow [2022-12-13 01:38:35,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:38:35,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:38:35,756 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:38:35,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 01:38:35,757 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:38:35,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:38:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash 664687392, now seen corresponding path program 1 times [2022-12-13 01:38:35,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:38:35,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025687596] [2022-12-13 01:38:35,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:38:35,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:38:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:38:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:38:35,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:38:35,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025687596] [2022-12-13 01:38:35,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025687596] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:38:35,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179734349] [2022-12-13 01:38:35,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:38:35,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:38:35,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:38:35,824 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:38:35,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 01:38:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:38:35,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:38:35,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:38:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:38:35,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:38:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:38:35,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179734349] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:38:35,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:38:35,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 01:38:35,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105106356] [2022-12-13 01:38:35,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:38:35,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:38:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:38:35,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:38:35,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:38:35,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 117 [2022-12-13 01:38:35,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 943 transitions, 30091 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-13 01:38:35,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:38:35,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 117 [2022-12-13 01:38:35,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:38:38,765 INFO L130 PetriNetUnfolder]: 4323/7074 cut-off events. [2022-12-13 01:38:38,765 INFO L131 PetriNetUnfolder]: For 344821/344821 co-relation queries the response was YES. [2022-12-13 01:38:38,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98049 conditions, 7074 events. 4323/7074 cut-off events. For 344821/344821 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 44560 event pairs, 686 based on Foata normal form. 386/7428 useless extension candidates. Maximal degree in co-relation 97839. Up to 4333 conditions per place. [2022-12-13 01:38:38,849 INFO L137 encePairwiseOnDemand]: 45/117 looper letters, 1193 selfloop transitions, 327 changer transitions 6/1526 dead transitions. [2022-12-13 01:38:38,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 1526 transitions, 51095 flow [2022-12-13 01:38:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 01:38:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 01:38:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 211 transitions. [2022-12-13 01:38:38,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11271367521367522 [2022-12-13 01:38:38,850 INFO L175 Difference]: Start difference. First operand has 266 places, 943 transitions, 30091 flow. Second operand 16 states and 211 transitions. [2022-12-13 01:38:38,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 1526 transitions, 51095 flow [2022-12-13 01:38:41,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 1526 transitions, 48606 flow, removed 286 selfloop flow, removed 12 redundant places. [2022-12-13 01:38:41,698 INFO L231 Difference]: Finished difference. Result has 277 places, 1062 transitions, 33186 flow [2022-12-13 01:38:41,699 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=27351, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=33186, PETRI_PLACES=277, PETRI_TRANSITIONS=1062} [2022-12-13 01:38:41,699 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 258 predicate places. [2022-12-13 01:38:41,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:38:41,700 INFO L89 Accepts]: Start accepts. Operand has 277 places, 1062 transitions, 33186 flow [2022-12-13 01:38:41,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:38:41,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:38:41,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 277 places, 1062 transitions, 33186 flow [2022-12-13 01:38:41,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 1062 transitions, 33186 flow [2022-12-13 01:38:42,442 INFO L130 PetriNetUnfolder]: 1417/2778 cut-off events. [2022-12-13 01:38:42,442 INFO L131 PetriNetUnfolder]: For 137667/138612 co-relation queries the response was YES. [2022-12-13 01:38:42,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43121 conditions, 2778 events. 1417/2778 cut-off events. For 137667/138612 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18633 event pairs, 33 based on Foata normal form. 11/2780 useless extension candidates. Maximal degree in co-relation 42885. Up to 2091 conditions per place. [2022-12-13 01:38:42,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 1062 transitions, 33186 flow [2022-12-13 01:38:42,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 2430 [2022-12-13 01:38:42,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [595] L41-6-->L41-6: Formula: (and (= v_~i1~0_643 (+ v_~i1~0_644 1)) (= v_~j1~0_771 0) (< v_~i1~0_643 v_~n~0_399) (not (< v_~j1~0_772 v_~m~0_447))) InVars {~m~0=v_~m~0_447, ~j1~0=v_~j1~0_772, ~i1~0=v_~i1~0_644, ~n~0=v_~n~0_399} OutVars{~m~0=v_~m~0_447, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_282|, ~j1~0=v_~j1~0_771, ~i1~0=v_~i1~0_643, ~n~0=v_~n~0_399} 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-13 01:38:42,607 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:38:42,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 908 [2022-12-13 01:38:42,608 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 1062 transitions, 33238 flow [2022-12-13 01:38:42,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-13 01:38:42,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:38:42,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:38:42,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 01:38:42,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 01:38:42,814 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:38:42,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:38:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1343998778, now seen corresponding path program 1 times [2022-12-13 01:38:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:38:42,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289061555] [2022-12-13 01:38:42,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:38:42,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:38:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:38:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:38:43,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:38:43,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289061555] [2022-12-13 01:38:43,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289061555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:38:43,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650629991] [2022-12-13 01:38:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:38:43,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:38:43,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:38:43,083 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:38:43,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 01:38:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:38:43,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 01:38:43,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:38:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:38:43,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:38:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:38:43,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650629991] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:38:43,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:38:43,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2022-12-13 01:38:43,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241768113] [2022-12-13 01:38:43,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:38:43,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:38:43,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:38:43,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:38:43,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:38:43,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 116 [2022-12-13 01:38:43,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 1062 transitions, 33238 flow. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:38:43,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:38:43,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 116 [2022-12-13 01:38:43,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:38:47,187 INFO L130 PetriNetUnfolder]: 4344/7108 cut-off events. [2022-12-13 01:38:47,187 INFO L131 PetriNetUnfolder]: For 280710/280710 co-relation queries the response was YES. [2022-12-13 01:38:47,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98642 conditions, 7108 events. 4344/7108 cut-off events. For 280710/280710 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 44924 event pairs, 138 based on Foata normal form. 1/7087 useless extension candidates. Maximal degree in co-relation 97858. Up to 7035 conditions per place. [2022-12-13 01:38:47,272 INFO L137 encePairwiseOnDemand]: 53/116 looper letters, 995 selfloop transitions, 89 changer transitions 6/1090 dead transitions. [2022-12-13 01:38:47,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 1090 transitions, 36076 flow [2022-12-13 01:38:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:38:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:38:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2022-12-13 01:38:47,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1724137931034483 [2022-12-13 01:38:47,273 INFO L175 Difference]: Start difference. First operand has 273 places, 1062 transitions, 33238 flow. Second operand 7 states and 140 transitions. [2022-12-13 01:38:47,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 1090 transitions, 36076 flow [2022-12-13 01:38:50,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 1090 transitions, 35713 flow, removed 179 selfloop flow, removed 2 redundant places. [2022-12-13 01:38:50,279 INFO L231 Difference]: Finished difference. Result has 279 places, 1073 transitions, 33459 flow [2022-12-13 01:38:50,280 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=32883, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=33459, PETRI_PLACES=279, PETRI_TRANSITIONS=1073} [2022-12-13 01:38:50,280 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 260 predicate places. [2022-12-13 01:38:50,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:38:50,281 INFO L89 Accepts]: Start accepts. Operand has 279 places, 1073 transitions, 33459 flow [2022-12-13 01:38:50,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:38:50,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:38:50,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 1073 transitions, 33459 flow [2022-12-13 01:38:50,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 1073 transitions, 33459 flow [2022-12-13 01:38:51,037 INFO L130 PetriNetUnfolder]: 1425/2797 cut-off events. [2022-12-13 01:38:51,037 INFO L131 PetriNetUnfolder]: For 146654/149789 co-relation queries the response was YES. [2022-12-13 01:38:51,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42961 conditions, 2797 events. 1425/2797 cut-off events. For 146654/149789 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 18851 event pairs, 48 based on Foata normal form. 2/2790 useless extension candidates. Maximal degree in co-relation 42703. Up to 2061 conditions per place. [2022-12-13 01:38:51,088 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 1073 transitions, 33459 flow [2022-12-13 01:38:51,088 INFO L226 LiptonReduction]: Number of co-enabled transitions 2452 [2022-12-13 01:38:51,091 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:38:51,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 811 [2022-12-13 01:38:51,091 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 1073 transitions, 33459 flow [2022-12-13 01:38:51,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:38:51,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:38:51,092 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:38:51,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 01:38:51,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 01:38:51,292 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:38:51,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:38:51,292 INFO L85 PathProgramCache]: Analyzing trace with hash -690034898, now seen corresponding path program 1 times [2022-12-13 01:38:51,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:38:51,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444132350] [2022-12-13 01:38:51,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:38:51,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:38:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:38:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 01:38:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:38:51,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444132350] [2022-12-13 01:38:51,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444132350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:38:51,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967450981] [2022-12-13 01:38:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:38:51,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:38:51,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:38:51,480 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:38:51,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 01:38:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:38:51,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 01:38:51,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:38:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:38:51,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:38:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:38:52,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967450981] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:38:52,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:38:52,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 4] total 11 [2022-12-13 01:38:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719507254] [2022-12-13 01:38:52,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:38:52,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:38:52,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:38:52,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:38:52,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-13 01:38:52,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 115 [2022-12-13 01:38:52,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 1073 transitions, 33459 flow. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:38:52,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:38:52,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 115 [2022-12-13 01:38:52,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:38:57,318 INFO L130 PetriNetUnfolder]: 4560/7473 cut-off events. [2022-12-13 01:38:57,318 INFO L131 PetriNetUnfolder]: For 301843/301843 co-relation queries the response was YES. [2022-12-13 01:38:57,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102912 conditions, 7473 events. 4560/7473 cut-off events. For 301843/301843 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 47689 event pairs, 148 based on Foata normal form. 3/7454 useless extension candidates. Maximal degree in co-relation 102315. Up to 5668 conditions per place. [2022-12-13 01:38:57,413 INFO L137 encePairwiseOnDemand]: 16/115 looper letters, 583 selfloop transitions, 627 changer transitions 20/1230 dead transitions. [2022-12-13 01:38:57,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1230 transitions, 40021 flow [2022-12-13 01:38:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 01:38:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 01:38:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 202 transitions. [2022-12-13 01:38:57,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.09758454106280193 [2022-12-13 01:38:57,416 INFO L175 Difference]: Start difference. First operand has 278 places, 1073 transitions, 33459 flow. Second operand 18 states and 202 transitions. [2022-12-13 01:38:57,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 1230 transitions, 40021 flow [2022-12-13 01:39:00,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 1230 transitions, 39828 flow, removed 68 selfloop flow, removed 1 redundant places. [2022-12-13 01:39:00,963 INFO L231 Difference]: Finished difference. Result has 304 places, 1170 transitions, 38739 flow [2022-12-13 01:39:00,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=33266, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1073, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=539, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=38739, PETRI_PLACES=304, PETRI_TRANSITIONS=1170} [2022-12-13 01:39:00,964 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 285 predicate places. [2022-12-13 01:39:00,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:39:00,965 INFO L89 Accepts]: Start accepts. Operand has 304 places, 1170 transitions, 38739 flow [2022-12-13 01:39:00,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:39:00,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:39:00,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 1170 transitions, 38739 flow [2022-12-13 01:39:00,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 304 places, 1170 transitions, 38739 flow [2022-12-13 01:39:01,881 INFO L130 PetriNetUnfolder]: 1494/2920 cut-off events. [2022-12-13 01:39:01,881 INFO L131 PetriNetUnfolder]: For 169370/172895 co-relation queries the response was YES. [2022-12-13 01:39:01,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47211 conditions, 2920 events. 1494/2920 cut-off events. For 169370/172895 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 19719 event pairs, 50 based on Foata normal form. 4/2915 useless extension candidates. Maximal degree in co-relation 46936. Up to 2165 conditions per place. [2022-12-13 01:39:01,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 304 places, 1170 transitions, 38739 flow [2022-12-13 01:39:01,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 2656 [2022-12-13 01:39:02,001 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-13 01:39:02,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L40-1-->L51-1: Formula: (and (= v_~j1~0_740 11) (= v_~k2~0_577 (+ v_~k2~0_578 v_~m~0_433)) (= v_~k1~0_724 (+ v_~k1~0_726 11)) (< v_~i2~0_575 v_~n~0_385) (< v_~i1~0_617 v_~n~0_385) (= v_~i2~0_574 (+ v_~i2~0_575 1)) (< v_~j1~0_740 (+ v_~m~0_433 1))) InVars {~m~0=v_~m~0_433, ~k2~0=v_~k2~0_578, ~k1~0=v_~k1~0_726, ~i2~0=v_~i2~0_575, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_317|, ~m~0=v_~m~0_433, ~k2~0=v_~k2~0_577, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_412|, ~k1~0=v_~k1~0_724, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~i2~0=v_~i2~0_574, ~j1~0=v_~j1~0_740, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [576] L41-6-->L41-6: Formula: (and (< v_~i1~0_591 v_~n~0_365) (= v_~i1~0_591 (+ v_~i1~0_592 1)) (not (< v_~j1~0_700 v_~m~0_411)) (= v_~j1~0_698 1) (< 0 v_~m~0_411) (= v_~k1~0_684 (+ v_~k1~0_685 1))) InVars {~m~0=v_~m~0_411, ~k1~0=v_~k1~0_685, ~j1~0=v_~j1~0_700, ~i1~0=v_~i1~0_592, ~n~0=v_~n~0_365} OutVars{~m~0=v_~m~0_411, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_388|, ~k1~0=v_~k1~0_684, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_390|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_260|, ~j1~0=v_~j1~0_698, ~i1~0=v_~i1~0_591, ~n~0=v_~n~0_365} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-13 01:39:02,214 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L40-1-->L51-1: Formula: (and (= v_~j1~0_740 11) (= v_~k2~0_577 (+ v_~k2~0_578 v_~m~0_433)) (= v_~k1~0_724 (+ v_~k1~0_726 11)) (< v_~i2~0_575 v_~n~0_385) (< v_~i1~0_617 v_~n~0_385) (= v_~i2~0_574 (+ v_~i2~0_575 1)) (< v_~j1~0_740 (+ v_~m~0_433 1))) InVars {~m~0=v_~m~0_433, ~k2~0=v_~k2~0_578, ~k1~0=v_~k1~0_726, ~i2~0=v_~i2~0_575, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_317|, ~m~0=v_~m~0_433, ~k2~0=v_~k2~0_577, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_412|, ~k1~0=v_~k1~0_724, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~i2~0=v_~i2~0_574, ~j1~0=v_~j1~0_740, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [601] L41-6-->L40-1: Formula: (and (not (< v_~j1~0_809 v_~m~0_459)) (= v_~j1~0_809 (+ v_~j1~0_810 1)) (= v_~k1~0_774 (+ v_~k1~0_775 1)) (< v_~j1~0_810 v_~m~0_459) (= v_~i1~0_672 (+ v_~i1~0_673 1))) InVars {~m~0=v_~m~0_459, ~k1~0=v_~k1~0_775, ~j1~0=v_~j1~0_810, ~i1~0=v_~i1~0_673} OutVars{~m~0=v_~m~0_459, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_442|, ~k1~0=v_~k1~0_774, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_444|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_301|, ~j1~0=v_~j1~0_809, ~i1~0=v_~i1~0_672} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-13 01:39:02,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L40-1-->L51-1: Formula: (and (= v_~j1~0_740 11) (= v_~k2~0_577 (+ v_~k2~0_578 v_~m~0_433)) (= v_~k1~0_724 (+ v_~k1~0_726 11)) (< v_~i2~0_575 v_~n~0_385) (< v_~i1~0_617 v_~n~0_385) (= v_~i2~0_574 (+ v_~i2~0_575 1)) (< v_~j1~0_740 (+ v_~m~0_433 1))) InVars {~m~0=v_~m~0_433, ~k2~0=v_~k2~0_578, ~k1~0=v_~k1~0_726, ~i2~0=v_~i2~0_575, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_317|, ~m~0=v_~m~0_433, ~k2~0=v_~k2~0_577, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_412|, ~k1~0=v_~k1~0_724, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~i2~0=v_~i2~0_574, ~j1~0=v_~j1~0_740, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [602] L41-6-->L51-1: Formula: (and (= (+ v_~i2~0_623 1) v_~i2~0_622) (= v_~k1~0_778 (+ v_~k1~0_779 1)) (< v_~i2~0_623 v_~n~0_411) (= (+ v_~j1~0_814 1) v_~j1~0_813) (= v_~k2~0_627 (+ v_~k2~0_628 v_~m~0_461)) (< v_~j1~0_814 v_~m~0_461)) InVars {~m~0=v_~m~0_461, ~k2~0=v_~k2~0_628, ~k1~0=v_~k1~0_779, ~i2~0=v_~i2~0_623, ~j1~0=v_~j1~0_814, ~n~0=v_~n~0_411} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_347|, ~m~0=v_~m~0_461, ~k2~0=v_~k2~0_627, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_444|, ~k1~0=v_~k1~0_778, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_446|, ~i2~0=v_~i2~0_622, ~j1~0=v_~j1~0_813, ~n~0=v_~n~0_411} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] [2022-12-13 01:39:02,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L40-1-->L51-1: Formula: (and (= v_~j1~0_740 11) (= v_~k2~0_577 (+ v_~k2~0_578 v_~m~0_433)) (= v_~k1~0_724 (+ v_~k1~0_726 11)) (< v_~i2~0_575 v_~n~0_385) (< v_~i1~0_617 v_~n~0_385) (= v_~i2~0_574 (+ v_~i2~0_575 1)) (< v_~j1~0_740 (+ v_~m~0_433 1))) InVars {~m~0=v_~m~0_433, ~k2~0=v_~k2~0_578, ~k1~0=v_~k1~0_726, ~i2~0=v_~i2~0_575, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_317|, ~m~0=v_~m~0_433, ~k2~0=v_~k2~0_577, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_412|, ~k1~0=v_~k1~0_724, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~i2~0=v_~i2~0_574, ~j1~0=v_~j1~0_740, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [603] L41-6-->L41-6: Formula: (and (= v_~j1~0_817 (+ 2 v_~j1~0_819)) (= v_~k1~0_782 (+ v_~k1~0_784 2)) (< (+ v_~j1~0_819 1) v_~m~0_463)) InVars {~m~0=v_~m~0_463, ~k1~0=v_~k1~0_784, ~j1~0=v_~j1~0_819} OutVars{~m~0=v_~m~0_463, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_446|, ~k1~0=v_~k1~0_782, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_448|, ~j1~0=v_~j1~0_817} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] [2022-12-13 01:39:02,495 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L40-1-->L51-1: Formula: (and (= v_~j1~0_740 11) (= v_~k2~0_577 (+ v_~k2~0_578 v_~m~0_433)) (= v_~k1~0_724 (+ v_~k1~0_726 11)) (< v_~i2~0_575 v_~n~0_385) (< v_~i1~0_617 v_~n~0_385) (= v_~i2~0_574 (+ v_~i2~0_575 1)) (< v_~j1~0_740 (+ v_~m~0_433 1))) InVars {~m~0=v_~m~0_433, ~k2~0=v_~k2~0_578, ~k1~0=v_~k1~0_726, ~i2~0=v_~i2~0_575, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_317|, ~m~0=v_~m~0_433, ~k2~0=v_~k2~0_577, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_412|, ~k1~0=v_~k1~0_724, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~i2~0=v_~i2~0_574, ~j1~0=v_~j1~0_740, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [577] L41-6-->L51-1: Formula: (and (< v_~i1~0_595 v_~n~0_367) (< v_~i2~0_547 v_~n~0_367) (= (+ v_~i2~0_547 1) v_~i2~0_546) (= v_~k2~0_549 (+ v_~k2~0_550 v_~m~0_413)) (= v_~j1~0_704 0) (not (< v_~j1~0_705 v_~m~0_413)) (= (+ v_~i1~0_596 1) v_~i1~0_595)) InVars {~m~0=v_~m~0_413, ~k2~0=v_~k2~0_550, ~i2~0=v_~i2~0_547, ~j1~0=v_~j1~0_705, ~i1~0=v_~i1~0_596, ~n~0=v_~n~0_367} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_301|, ~m~0=v_~m~0_413, ~k2~0=v_~k2~0_549, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_262|, ~i2~0=v_~i2~0_546, ~j1~0=v_~j1~0_704, ~i1~0=v_~i1~0_595, ~n~0=v_~n~0_367} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~0] [2022-12-13 01:39:02,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L40-1-->L51-1: Formula: (and (= v_~j1~0_740 11) (= v_~k2~0_577 (+ v_~k2~0_578 v_~m~0_433)) (= v_~k1~0_724 (+ v_~k1~0_726 11)) (< v_~i2~0_575 v_~n~0_385) (< v_~i1~0_617 v_~n~0_385) (= v_~i2~0_574 (+ v_~i2~0_575 1)) (< v_~j1~0_740 (+ v_~m~0_433 1))) InVars {~m~0=v_~m~0_433, ~k2~0=v_~k2~0_578, ~k1~0=v_~k1~0_726, ~i2~0=v_~i2~0_575, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_317|, ~m~0=v_~m~0_433, ~k2~0=v_~k2~0_577, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_412|, ~k1~0=v_~k1~0_724, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~i2~0=v_~i2~0_574, ~j1~0=v_~j1~0_740, ~i1~0=v_~i1~0_617, ~n~0=v_~n~0_385} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [567] L41-6-->L51-1: Formula: (and (= (+ v_~i1~0_562 1) v_~i1~0_561) (= v_~i2~0_518 (+ v_~i2~0_519 1)) (= (+ v_~k2~0_522 v_~m~0_399) v_~k2~0_521) (not (< v_~j1~0_682 v_~m~0_399)) (< v_~i2~0_519 v_~n~0_353)) InVars {~m~0=v_~m~0_399, ~k2~0=v_~k2~0_522, ~i2~0=v_~i2~0_519, ~j1~0=v_~j1~0_682, ~i1~0=v_~i1~0_562, ~n~0=v_~n~0_353} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_285|, ~m~0=v_~m~0_399, ~k2~0=v_~k2~0_521, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_242|, ~i2~0=v_~i2~0_518, ~j1~0=v_~j1~0_682, ~i1~0=v_~i1~0_561, ~n~0=v_~n~0_353} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0] [2022-12-13 01:39:02,798 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-13 01:39:02,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L40-1-->L41-6: Formula: (and (< v_~i2~0_641 v_~n~0_419) (= v_~k1~0_806 (+ v_~k1~0_808 13)) (< v_~i1~0_686 v_~n~0_419) (= v_~i2~0_640 (+ v_~i2~0_641 1)) (= v_~k2~0_645 (+ v_~k2~0_646 v_~m~0_471)) (< 12 v_~m~0_471) (= v_~j1~0_835 13)) InVars {~m~0=v_~m~0_471, ~k1~0=v_~k1~0_808, ~k2~0=v_~k2~0_646, ~i2~0=v_~i2~0_641, ~i1~0=v_~i1~0_686, ~n~0=v_~n~0_419} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_357|, ~m~0=v_~m~0_471, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_462|, ~k1~0=v_~k1~0_806, ~k2~0=v_~k2~0_645, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_464|, ~j1~0=v_~j1~0_835, ~i2~0=v_~i2~0_640, ~i1~0=v_~i1~0_686, ~n~0=v_~n~0_419} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, ~k1~0, ~k2~0, thread1Thread1of1ForFork0_#t~post2, ~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-13 01:39:03,203 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] L40-1-->L40-1: Formula: (and (not (< v_~j1~0_853 v_~m~0_483)) (= v_~i1~0_702 (+ v_~i1~0_703 1)) (< v_~i2~0_667 v_~n~0_431) (= v_~k2~0_671 (+ v_~k2~0_672 v_~m~0_483)) (< v_~i1~0_703 v_~n~0_431) (= v_~j1~0_853 13) (= v_~k1~0_828 (+ v_~k1~0_829 13)) (< 12 v_~m~0_483) (= v_~i2~0_666 (+ v_~i2~0_667 1))) InVars {~m~0=v_~m~0_483, ~k1~0=v_~k1~0_829, ~k2~0=v_~k2~0_672, ~i2~0=v_~i2~0_667, ~i1~0=v_~i1~0_703, ~n~0=v_~n~0_431} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_373|, ~m~0=v_~m~0_483, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_474|, ~k1~0=v_~k1~0_828, ~k2~0=v_~k2~0_671, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_476|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_311|, ~j1~0=v_~j1~0_853, ~i2~0=v_~i2~0_666, ~i1~0=v_~i1~0_702, ~n~0=v_~n~0_431} 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-13 01:39:03,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L40-1-->L40-1: Formula: (and (not (< v_~j1~0_827 v_~m~0_467)) (< v_~i1~0_681 v_~n~0_415) (= 12 v_~j1~0_827) (< v_~j1~0_827 (+ v_~m~0_467 1)) (= (+ v_~i2~0_631 1) v_~i2~0_630) (= v_~i1~0_680 (+ v_~i1~0_681 1)) (= v_~k1~0_794 (+ v_~k1~0_796 12)) (< v_~i2~0_631 v_~n~0_415) (= v_~k2~0_635 (+ v_~k2~0_636 v_~m~0_467))) InVars {~m~0=v_~m~0_467, ~k1~0=v_~k1~0_796, ~k2~0=v_~k2~0_636, ~i2~0=v_~i2~0_631, ~i1~0=v_~i1~0_681, ~n~0=v_~n~0_415} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_351|, ~m~0=v_~m~0_467, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_454|, ~k1~0=v_~k1~0_794, ~k2~0=v_~k2~0_635, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_456|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_305|, ~j1~0=v_~j1~0_827, ~i2~0=v_~i2~0_630, ~i1~0=v_~i1~0_680, ~n~0=v_~n~0_415} 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-13 01:39:03,761 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 01:39:03,762 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2798 [2022-12-13 01:39:03,762 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 1168 transitions, 39118 flow [2022-12-13 01:39:03,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:39:03,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:39:03,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:39:03,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 01:39:03,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:39:03,970 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:39:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:39:03,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1952131557, now seen corresponding path program 1 times [2022-12-13 01:39:03,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:39:03,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599909274] [2022-12-13 01:39:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:39:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:39:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:39:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:39:04,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:39:04,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599909274] [2022-12-13 01:39:04,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599909274] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:39:04,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622120546] [2022-12-13 01:39:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:39:04,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:39:04,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:39:04,232 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:39:04,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 01:39:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:39:04,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 01:39:04,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:39:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:39:04,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:39:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:39:04,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622120546] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:39:04,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:39:04,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2022-12-13 01:39:04,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515374828] [2022-12-13 01:39:04,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:39:04,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:39:04,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:39:04,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:39:04,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:39:04,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 126 [2022-12-13 01:39:04,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 1168 transitions, 39118 flow. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:39:04,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:39:04,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 126 [2022-12-13 01:39:04,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:39:08,081 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 [] [2022-12-13 01:39:10,143 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 [] [2022-12-13 01:39:12,242 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 [] [2022-12-13 01:39:15,303 INFO L130 PetriNetUnfolder]: 4545/7427 cut-off events. [2022-12-13 01:39:15,303 INFO L131 PetriNetUnfolder]: For 338040/338040 co-relation queries the response was YES. [2022-12-13 01:39:15,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107435 conditions, 7427 events. 4545/7427 cut-off events. For 338040/338040 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 47125 event pairs, 140 based on Foata normal form. 1/7406 useless extension candidates. Maximal degree in co-relation 106670. Up to 7254 conditions per place. [2022-12-13 01:39:15,393 INFO L137 encePairwiseOnDemand]: 41/126 looper letters, 1035 selfloop transitions, 157 changer transitions 10/1202 dead transitions. [2022-12-13 01:39:15,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1202 transitions, 42133 flow [2022-12-13 01:39:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:39:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:39:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2022-12-13 01:39:15,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13253968253968254 [2022-12-13 01:39:15,394 INFO L175 Difference]: Start difference. First operand has 302 places, 1168 transitions, 39118 flow. Second operand 10 states and 167 transitions. [2022-12-13 01:39:15,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 1202 transitions, 42133 flow [2022-12-13 01:39:19,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 1202 transitions, 41127 flow, removed 460 selfloop flow, removed 3 redundant places. [2022-12-13 01:39:19,342 INFO L231 Difference]: Finished difference. Result has 311 places, 1178 transitions, 38752 flow [2022-12-13 01:39:19,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=38133, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=38752, PETRI_PLACES=311, PETRI_TRANSITIONS=1178} [2022-12-13 01:39:19,343 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 292 predicate places. [2022-12-13 01:39:19,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:39:19,344 INFO L89 Accepts]: Start accepts. Operand has 311 places, 1178 transitions, 38752 flow [2022-12-13 01:39:19,349 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:39:19,350 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:39:19,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 1178 transitions, 38752 flow [2022-12-13 01:39:19,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 1178 transitions, 38752 flow [2022-12-13 01:39:20,183 INFO L130 PetriNetUnfolder]: 1496/2924 cut-off events. [2022-12-13 01:39:20,183 INFO L131 PetriNetUnfolder]: For 170686/174229 co-relation queries the response was YES. [2022-12-13 01:39:20,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47129 conditions, 2924 events. 1496/2924 cut-off events. For 170686/174229 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19754 event pairs, 52 based on Foata normal form. 4/2915 useless extension candidates. Maximal degree in co-relation 46853. Up to 2132 conditions per place. [2022-12-13 01:39:20,239 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 307 places, 1178 transitions, 38752 flow [2022-12-13 01:39:20,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 2666 [2022-12-13 01:39:20,241 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-13 01:39:20,481 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-13 01:39:20,631 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] L40-1-->L51-1: Formula: (and (= (+ v_~k1~0_499 5) v_~k1~0_498) (= 2 v_~j1~0_527) (< v_~i1~0_420 v_~n~0_275) (= v_~k2~0_381 (+ v_~k2~0_383 (* 2 v_~m~0_317))) (= v_~i1~0_420 (+ v_~i1~0_421 1)) (< 2 v_~m~0_317) (<= v_~m~0_317 3) (= v_~i2~0_381 (+ 2 v_~i2~0_383)) (< v_~i2~0_381 (+ v_~n~0_275 1))) InVars {~m~0=v_~m~0_317, ~k2~0=v_~k2~0_383, ~k1~0=v_~k1~0_499, ~i2~0=v_~i2~0_383, ~i1~0=v_~i1~0_421, ~n~0=v_~n~0_275} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_203|, ~m~0=v_~m~0_317, ~k2~0=v_~k2~0_381, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_279|, ~k1~0=v_~k1~0_498, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_281|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_176|, ~i2~0=v_~i2~0_381, ~j1~0=v_~j1~0_527, ~i1~0=v_~i1~0_420, ~n~0=v_~n~0_275} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~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-13 01:39:20,746 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 01:39:20,746 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1402 [2022-12-13 01:39:20,747 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 1174 transitions, 38754 flow [2022-12-13 01:39:20,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:39:20,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:39:20,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:39:20,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 01:39:20,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 01:39:20,958 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:39:20,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:39:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash 669153018, now seen corresponding path program 1 times [2022-12-13 01:39:20,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:39:20,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111684818] [2022-12-13 01:39:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:39:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:39:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:39:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:39:21,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:39:21,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111684818] [2022-12-13 01:39:21,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111684818] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:39:21,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69471552] [2022-12-13 01:39:21,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:39:21,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:39:21,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:39:21,194 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:39:21,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 01:39:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:39:21,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 01:39:21,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:39:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:39:21,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:39:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:39:21,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69471552] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:39:21,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:39:21,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-13 01:39:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384047270] [2022-12-13 01:39:21,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:39:21,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:39:21,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:39:21,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:39:21,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:39:21,885 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 126 [2022-12-13 01:39:21,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 1174 transitions, 38754 flow. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:39:21,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:39:21,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 126 [2022-12-13 01:39:21,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:39:24,941 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 [] [2022-12-13 01:39:27,005 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 [] [2022-12-13 01:39:29,558 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-13 01:39:32,602 INFO L130 PetriNetUnfolder]: 4533/7402 cut-off events. [2022-12-13 01:39:32,603 INFO L131 PetriNetUnfolder]: For 330785/330785 co-relation queries the response was YES. [2022-12-13 01:39:32,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106532 conditions, 7402 events. 4533/7402 cut-off events. For 330785/330785 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 47028 event pairs, 134 based on Foata normal form. 1/7379 useless extension candidates. Maximal degree in co-relation 105727. Up to 7208 conditions per place. [2022-12-13 01:39:32,691 INFO L137 encePairwiseOnDemand]: 43/126 looper letters, 1029 selfloop transitions, 161 changer transitions 13/1203 dead transitions. [2022-12-13 01:39:32,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 1203 transitions, 41568 flow [2022-12-13 01:39:32,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:39:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:39:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2022-12-13 01:39:32,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12554112554112554 [2022-12-13 01:39:32,692 INFO L175 Difference]: Start difference. First operand has 306 places, 1174 transitions, 38754 flow. Second operand 11 states and 174 transitions. [2022-12-13 01:39:32,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 1203 transitions, 41568 flow [2022-12-13 01:39:36,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 1203 transitions, 41173 flow, removed 71 selfloop flow, removed 3 redundant places. [2022-12-13 01:39:36,543 INFO L231 Difference]: Finished difference. Result has 314 places, 1175 transitions, 38680 flow [2022-12-13 01:39:36,544 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=38359, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=38680, PETRI_PLACES=314, PETRI_TRANSITIONS=1175} [2022-12-13 01:39:36,544 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 295 predicate places. [2022-12-13 01:39:36,544 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:39:36,544 INFO L89 Accepts]: Start accepts. Operand has 314 places, 1175 transitions, 38680 flow [2022-12-13 01:39:36,552 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:39:36,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:39:36,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 314 places, 1175 transitions, 38680 flow [2022-12-13 01:39:36,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 1175 transitions, 38680 flow [2022-12-13 01:39:37,388 INFO L130 PetriNetUnfolder]: 1493/2917 cut-off events. [2022-12-13 01:39:37,389 INFO L131 PetriNetUnfolder]: For 168660/171867 co-relation queries the response was YES. [2022-12-13 01:39:37,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47035 conditions, 2917 events. 1493/2917 cut-off events. For 168660/171867 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 19737 event pairs, 48 based on Foata normal form. 6/2913 useless extension candidates. Maximal degree in co-relation 46744. Up to 2128 conditions per place. [2022-12-13 01:39:37,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 312 places, 1175 transitions, 38680 flow [2022-12-13 01:39:37,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 2660 [2022-12-13 01:39:37,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [505] L40-1-->L51-1: Formula: (and (< v_~i2~0_318 v_~n~0_243) (< 7 v_~m~0_281) (= (+ v_~i2~0_318 1) v_~i2~0_317) (= v_~i1~0_362 (+ v_~i1~0_363 1)) (= v_~k1~0_410 (+ v_~k1~0_411 8)) (= (+ v_~k2~0_318 v_~m~0_281) v_~k2~0_317) (<= v_~m~0_281 8) (< v_~i1~0_362 v_~n~0_243) (= v_~j1~0_457 0)) InVars {~m~0=v_~m~0_281, ~k2~0=v_~k2~0_318, ~k1~0=v_~k1~0_411, ~i2~0=v_~i2~0_318, ~i1~0=v_~i1~0_363, ~n~0=v_~n~0_243} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_167|, ~m~0=v_~m~0_281, ~k2~0=v_~k2~0_317, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_227|, ~k1~0=v_~k1~0_410, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_229|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_150|, ~i2~0=v_~i2~0_317, ~j1~0=v_~j1~0_457, ~i1~0=v_~i1~0_362, ~n~0=v_~n~0_243} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~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-13 01:39:37,706 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-13 01:39:37,819 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:39:37,820 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1276 [2022-12-13 01:39:37,820 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 1175 transitions, 38782 flow [2022-12-13 01:39:37,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:39:37,820 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:39:37,820 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:39:37,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 01:39:38,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:39:38,021 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:39:38,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:39:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash -926747792, now seen corresponding path program 1 times [2022-12-13 01:39:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:39:38,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387372807] [2022-12-13 01:39:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:39:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:39:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:39:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:39:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:39:38,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387372807] [2022-12-13 01:39:38,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387372807] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:39:38,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658137979] [2022-12-13 01:39:38,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:39:38,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:39:38,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:39:38,074 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:39:38,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 01:39:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:39:38,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:39:38,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:39:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:39:38,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:39:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:39:38,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658137979] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:39:38,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:39:38,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 01:39:38,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330576040] [2022-12-13 01:39:38,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:39:38,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:39:38,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:39:38,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:39:38,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:39:38,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 130 [2022-12-13 01:39:38,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 1175 transitions, 38782 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-13 01:39:38,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:39:38,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 130 [2022-12-13 01:39:38,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:39:41,904 INFO L130 PetriNetUnfolder]: 4629/7640 cut-off events. [2022-12-13 01:39:41,905 INFO L131 PetriNetUnfolder]: For 357684/357684 co-relation queries the response was YES. [2022-12-13 01:39:41,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110113 conditions, 7640 events. 4629/7640 cut-off events. For 357684/357684 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 49575 event pairs, 701 based on Foata normal form. 96/7712 useless extension candidates. Maximal degree in co-relation 109322. Up to 4525 conditions per place. [2022-12-13 01:39:42,045 INFO L137 encePairwiseOnDemand]: 40/130 looper letters, 750 selfloop transitions, 609 changer transitions 5/1364 dead transitions. [2022-12-13 01:39:42,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 1364 transitions, 47640 flow [2022-12-13 01:39:42,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:39:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:39:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-12-13 01:39:42,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1879120879120879 [2022-12-13 01:39:42,046 INFO L175 Difference]: Start difference. First operand has 312 places, 1175 transitions, 38782 flow. Second operand 7 states and 171 transitions. [2022-12-13 01:39:42,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 1364 transitions, 47640 flow [2022-12-13 01:39:45,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 1364 transitions, 47325 flow, removed 36 selfloop flow, removed 6 redundant places. [2022-12-13 01:39:45,731 INFO L231 Difference]: Finished difference. Result has 315 places, 1210 transitions, 42076 flow [2022-12-13 01:39:45,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=37975, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=550, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=42076, PETRI_PLACES=315, PETRI_TRANSITIONS=1210} [2022-12-13 01:39:45,732 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 296 predicate places. [2022-12-13 01:39:45,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:39:45,732 INFO L89 Accepts]: Start accepts. Operand has 315 places, 1210 transitions, 42076 flow [2022-12-13 01:39:45,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:39:45,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:39:45,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 315 places, 1210 transitions, 42076 flow [2022-12-13 01:39:45,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 314 places, 1210 transitions, 42076 flow [2022-12-13 01:39:46,650 INFO L130 PetriNetUnfolder]: 1511/3000 cut-off events. [2022-12-13 01:39:46,651 INFO L131 PetriNetUnfolder]: For 186040/189277 co-relation queries the response was YES. [2022-12-13 01:39:46,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50057 conditions, 3000 events. 1511/3000 cut-off events. For 186040/189277 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 20748 event pairs, 59 based on Foata normal form. 7/2997 useless extension candidates. Maximal degree in co-relation 49748. Up to 2183 conditions per place. [2022-12-13 01:39:46,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 314 places, 1210 transitions, 42076 flow [2022-12-13 01:39:46,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 2736 [2022-12-13 01:39:46,713 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:39:46,714 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 982 [2022-12-13 01:39:46,714 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 1210 transitions, 42076 flow [2022-12-13 01:39:46,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-13 01:39:46,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:39:46,714 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:39:46,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 01:39:46,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:39:46,916 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:39:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:39:46,916 INFO L85 PathProgramCache]: Analyzing trace with hash -108085125, now seen corresponding path program 1 times [2022-12-13 01:39:46,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:39:46,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391006011] [2022-12-13 01:39:46,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:39:46,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:39:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:39:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 01:39:47,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:39:47,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391006011] [2022-12-13 01:39:47,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391006011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:39:47,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096266437] [2022-12-13 01:39:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:39:47,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:39:47,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:39:47,101 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:39:47,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 01:39:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:39:47,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 01:39:47,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:39:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:39:47,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:39:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:39:47,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096266437] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:39:47,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:39:47,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 5] total 13 [2022-12-13 01:39:47,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523977887] [2022-12-13 01:39:47,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:39:47,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 01:39:47,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:39:47,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 01:39:47,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-13 01:39:47,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 127 [2022-12-13 01:39:47,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 1210 transitions, 42076 flow. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:39:47,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:39:47,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 127 [2022-12-13 01:39:47,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:39:57,766 INFO L130 PetriNetUnfolder]: 5398/8879 cut-off events. [2022-12-13 01:39:57,766 INFO L131 PetriNetUnfolder]: For 439101/439101 co-relation queries the response was YES. [2022-12-13 01:39:57,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133787 conditions, 8879 events. 5398/8879 cut-off events. For 439101/439101 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 58081 event pairs, 142 based on Foata normal form. 2/8857 useless extension candidates. Maximal degree in co-relation 131801. Up to 5395 conditions per place. [2022-12-13 01:39:57,875 INFO L137 encePairwiseOnDemand]: 17/127 looper letters, 512 selfloop transitions, 1011 changer transitions 22/1545 dead transitions. [2022-12-13 01:39:57,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 1545 transitions, 55853 flow [2022-12-13 01:39:57,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 01:39:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 01:39:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 282 transitions. [2022-12-13 01:39:57,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.07930258717660292 [2022-12-13 01:39:57,877 INFO L175 Difference]: Start difference. First operand has 314 places, 1210 transitions, 42076 flow. Second operand 28 states and 282 transitions. [2022-12-13 01:39:57,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 1545 transitions, 55853 flow [2022-12-13 01:40:02,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 1545 transitions, 54791 flow, removed 241 selfloop flow, removed 2 redundant places. [2022-12-13 01:40:02,892 INFO L231 Difference]: Finished difference. Result has 351 places, 1441 transitions, 54057 flow [2022-12-13 01:40:02,893 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=41198, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=809, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=54057, PETRI_PLACES=351, PETRI_TRANSITIONS=1441} [2022-12-13 01:40:02,893 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 332 predicate places. [2022-12-13 01:40:02,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:40:02,894 INFO L89 Accepts]: Start accepts. Operand has 351 places, 1441 transitions, 54057 flow [2022-12-13 01:40:02,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:40:02,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:40:02,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 351 places, 1441 transitions, 54057 flow [2022-12-13 01:40:02,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 351 places, 1441 transitions, 54057 flow [2022-12-13 01:40:04,256 INFO L130 PetriNetUnfolder]: 1779/3504 cut-off events. [2022-12-13 01:40:04,256 INFO L131 PetriNetUnfolder]: For 227726/231518 co-relation queries the response was YES. [2022-12-13 01:40:04,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62343 conditions, 3504 events. 1779/3504 cut-off events. For 227726/231518 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24439 event pairs, 52 based on Foata normal form. 8/3503 useless extension candidates. Maximal degree in co-relation 61990. Up to 2615 conditions per place. [2022-12-13 01:40:04,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 351 places, 1441 transitions, 54057 flow [2022-12-13 01:40:04,330 INFO L226 LiptonReduction]: Number of co-enabled transitions 3158 [2022-12-13 01:40:04,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:40:04,434 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:40:04,636 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-13 01:40:04,826 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [627] L40-1-->L51-1: Formula: (and (< 2 v_~m~0_511) (= v_~k2~0_739 (+ v_~k2~0_741 (* 3 v_~m~0_511))) (<= v_~m~0_511 3) (= 2 v_~j1~0_898) (< v_~i2~0_732 (+ v_~n~0_457 1)) (= (+ v_~k1~0_883 5) v_~k1~0_882) (= (+ 3 v_~i2~0_734) v_~i2~0_732) (< v_~i1~0_742 v_~n~0_457) (= (+ v_~i1~0_743 1) v_~i1~0_742)) InVars {~m~0=v_~m~0_511, ~k2~0=v_~k2~0_741, ~k1~0=v_~k1~0_883, ~i2~0=v_~i2~0_734, ~i1~0=v_~i1~0_743, ~n~0=v_~n~0_457} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_414|, ~m~0=v_~m~0_511, ~k2~0=v_~k2~0_739, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_505|, ~k1~0=v_~k1~0_882, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_507|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_330|, ~i2~0=v_~i2~0_732, ~j1~0=v_~j1~0_898, ~i1~0=v_~i1~0_742, ~n~0=v_~n~0_457} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~0] and [640] L41-6-->L40-1: Formula: (and (< v_~j1~0_947 v_~m~0_533) (not (< v_~j1~0_946 v_~m~0_533)) (= v_~k1~0_924 (+ v_~k1~0_925 1)) (= (+ v_~i1~0_784 1) v_~i1~0_783) (= (+ v_~j1~0_947 1) v_~j1~0_946)) InVars {~m~0=v_~m~0_533, ~k1~0=v_~k1~0_925, ~j1~0=v_~j1~0_947, ~i1~0=v_~i1~0_784} OutVars{~m~0=v_~m~0_533, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_532|, ~k1~0=v_~k1~0_924, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_534|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_355|, ~j1~0=v_~j1~0_946, ~i1~0=v_~i1~0_783} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-13 01:40:04,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [627] L40-1-->L51-1: Formula: (and (< 2 v_~m~0_511) (= v_~k2~0_739 (+ v_~k2~0_741 (* 3 v_~m~0_511))) (<= v_~m~0_511 3) (= 2 v_~j1~0_898) (< v_~i2~0_732 (+ v_~n~0_457 1)) (= (+ v_~k1~0_883 5) v_~k1~0_882) (= (+ 3 v_~i2~0_734) v_~i2~0_732) (< v_~i1~0_742 v_~n~0_457) (= (+ v_~i1~0_743 1) v_~i1~0_742)) InVars {~m~0=v_~m~0_511, ~k2~0=v_~k2~0_741, ~k1~0=v_~k1~0_883, ~i2~0=v_~i2~0_734, ~i1~0=v_~i1~0_743, ~n~0=v_~n~0_457} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_414|, ~m~0=v_~m~0_511, ~k2~0=v_~k2~0_739, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_505|, ~k1~0=v_~k1~0_882, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_507|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_330|, ~i2~0=v_~i2~0_732, ~j1~0=v_~j1~0_898, ~i1~0=v_~i1~0_742, ~n~0=v_~n~0_457} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~0] and [641] L41-6-->L41-6: Formula: (and (= v_~j1~0_950 (+ 2 v_~j1~0_952)) (= v_~k1~0_928 (+ v_~k1~0_930 2)) (< v_~j1~0_950 (+ v_~m~0_535 1))) InVars {~m~0=v_~m~0_535, ~k1~0=v_~k1~0_930, ~j1~0=v_~j1~0_952} OutVars{~m~0=v_~m~0_535, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_534|, ~k1~0=v_~k1~0_928, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_536|, ~j1~0=v_~j1~0_950} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] [2022-12-13 01:40:04,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [627] L40-1-->L51-1: Formula: (and (< 2 v_~m~0_511) (= v_~k2~0_739 (+ v_~k2~0_741 (* 3 v_~m~0_511))) (<= v_~m~0_511 3) (= 2 v_~j1~0_898) (< v_~i2~0_732 (+ v_~n~0_457 1)) (= (+ v_~k1~0_883 5) v_~k1~0_882) (= (+ 3 v_~i2~0_734) v_~i2~0_732) (< v_~i1~0_742 v_~n~0_457) (= (+ v_~i1~0_743 1) v_~i1~0_742)) InVars {~m~0=v_~m~0_511, ~k2~0=v_~k2~0_741, ~k1~0=v_~k1~0_883, ~i2~0=v_~i2~0_734, ~i1~0=v_~i1~0_743, ~n~0=v_~n~0_457} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_414|, ~m~0=v_~m~0_511, ~k2~0=v_~k2~0_739, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_505|, ~k1~0=v_~k1~0_882, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_507|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_330|, ~i2~0=v_~i2~0_732, ~j1~0=v_~j1~0_898, ~i1~0=v_~i1~0_742, ~n~0=v_~n~0_457} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~0] and [642] L41-6-->L51-1: Formula: (and (= v_~k1~0_934 (+ v_~k1~0_935 1)) (= (+ v_~j1~0_957 1) v_~j1~0_956) (< v_~j1~0_957 v_~m~0_537) (= (+ v_~i2~0_776 1) v_~i2~0_775) (= v_~k2~0_785 (+ v_~k2~0_786 v_~m~0_537)) (< v_~i2~0_776 v_~n~0_477)) InVars {~m~0=v_~m~0_537, ~k2~0=v_~k2~0_786, ~k1~0=v_~k1~0_935, ~i2~0=v_~i2~0_776, ~j1~0=v_~j1~0_957, ~n~0=v_~n~0_477} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_443|, ~m~0=v_~m~0_537, ~k2~0=v_~k2~0_785, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_538|, ~k1~0=v_~k1~0_934, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_540|, ~i2~0=v_~i2~0_775, ~j1~0=v_~j1~0_956, ~n~0=v_~n~0_477} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] [2022-12-13 01:40:05,303 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-13 01:40:05,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [586] L40-1-->L41-6: Formula: (and (= v_~k1~0_718 (+ v_~k1~0_720 12)) (= 12 v_~j1~0_736) (< v_~j1~0_736 (+ v_~m~0_431 1)) (< v_~i1~0_615 v_~n~0_383)) InVars {~m~0=v_~m~0_431, ~k1~0=v_~k1~0_720, ~i1~0=v_~i1~0_615, ~n~0=v_~n~0_383} OutVars{~m~0=v_~m~0_431, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_408|, ~k1~0=v_~k1~0_718, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_410|, ~j1~0=v_~j1~0_736, ~i1~0=v_~i1~0_615, ~n~0=v_~n~0_383} 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-13 01:40:05,691 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 01:40:05,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2798 [2022-12-13 01:40:05,692 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 1438 transitions, 54305 flow [2022-12-13 01:40:05,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:40:05,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:40:05,692 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:40:05,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 01:40:05,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:40:05,898 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:40:05,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:40:05,900 INFO L85 PathProgramCache]: Analyzing trace with hash -444428831, now seen corresponding path program 2 times [2022-12-13 01:40:05,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:40:05,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268186367] [2022-12-13 01:40:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:40:05,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:40:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:40:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:40:06,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:40:06,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268186367] [2022-12-13 01:40:06,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268186367] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:40:06,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346906487] [2022-12-13 01:40:06,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:40:06,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:40:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:40:06,120 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:40:06,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 01:40:06,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:40:06,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:40:06,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 01:40:06,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:40:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:40:06,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:40:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:40:07,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346906487] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:40:07,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:40:07,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2022-12-13 01:40:07,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574094890] [2022-12-13 01:40:07,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:40:07,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 01:40:07,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:40:07,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 01:40:07,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-12-13 01:40:07,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 140 [2022-12-13 01:40:07,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 1438 transitions, 54305 flow. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:40:07,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:40:07,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 140 [2022-12-13 01:40:07,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:40:13,686 INFO L130 PetriNetUnfolder]: 5385/8878 cut-off events. [2022-12-13 01:40:13,687 INFO L131 PetriNetUnfolder]: For 464982/464982 co-relation queries the response was YES. [2022-12-13 01:40:13,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141202 conditions, 8878 events. 5385/8878 cut-off events. For 464982/464982 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 58406 event pairs, 96 based on Foata normal form. 4/8860 useless extension candidates. Maximal degree in co-relation 139974. Up to 8662 conditions per place. [2022-12-13 01:40:13,801 INFO L137 encePairwiseOnDemand]: 61/140 looper letters, 1374 selfloop transitions, 122 changer transitions 22/1518 dead transitions. [2022-12-13 01:40:13,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 1518 transitions, 59541 flow [2022-12-13 01:40:13,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:40:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:40:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2022-12-13 01:40:13,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13506493506493505 [2022-12-13 01:40:13,803 INFO L175 Difference]: Start difference. First operand has 348 places, 1438 transitions, 54305 flow. Second operand 11 states and 208 transitions. [2022-12-13 01:40:13,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 1518 transitions, 59541 flow [2022-12-13 01:40:20,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 1518 transitions, 56770 flow, removed 1285 selfloop flow, removed 5 redundant places. [2022-12-13 01:40:20,611 INFO L231 Difference]: Finished difference. Result has 360 places, 1462 transitions, 52592 flow [2022-12-13 01:40:20,612 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=51511, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=52592, PETRI_PLACES=360, PETRI_TRANSITIONS=1462} [2022-12-13 01:40:20,612 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 341 predicate places. [2022-12-13 01:40:20,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:40:20,613 INFO L89 Accepts]: Start accepts. Operand has 360 places, 1462 transitions, 52592 flow [2022-12-13 01:40:20,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:40:20,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:40:20,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 360 places, 1462 transitions, 52592 flow [2022-12-13 01:40:20,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 1462 transitions, 52592 flow [2022-12-13 01:40:22,032 INFO L130 PetriNetUnfolder]: 1807/3586 cut-off events. [2022-12-13 01:40:22,032 INFO L131 PetriNetUnfolder]: For 227485/232934 co-relation queries the response was YES. [2022-12-13 01:40:22,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61825 conditions, 3586 events. 1807/3586 cut-off events. For 227485/232934 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 25368 event pairs, 47 based on Foata normal form. 1/3577 useless extension candidates. Maximal degree in co-relation 61480. Up to 2636 conditions per place. [2022-12-13 01:40:22,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 1462 transitions, 52592 flow [2022-12-13 01:40:22,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 3192 [2022-12-13 01:40:22,108 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [408] L40-1-->L40-1: Formula: (and (< v_~i1~0_104 v_~n~0_77) (= (+ v_~k1~0_98 1) v_~k1~0_97) (= (+ v_~i1~0_104 1) v_~i1~0_103) (= v_~j1~0_103 1) (not (< v_~j1~0_103 v_~m~0_87)) (< v_~j1~0_103 (+ v_~m~0_87 1))) InVars {~m~0=v_~m~0_87, ~k1~0=v_~k1~0_98, ~i1~0=v_~i1~0_104, ~n~0=v_~n~0_77} OutVars{~m~0=v_~m~0_87, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_30|, ~k1~0=v_~k1~0_97, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_32|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_39|, ~j1~0=v_~j1~0_103, ~i1~0=v_~i1~0_103, ~n~0=v_~n~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, 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-13 01:40:22,175 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:40:22,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1563 [2022-12-13 01:40:22,176 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 1462 transitions, 52605 flow [2022-12-13 01:40:22,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:40:22,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:40:22,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:40:22,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 01:40:22,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:40:22,377 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:40:22,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:40:22,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1140908651, now seen corresponding path program 1 times [2022-12-13 01:40:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:40:22,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14721974] [2022-12-13 01:40:22,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:40:22,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:40:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:40:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:40:22,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:40:22,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14721974] [2022-12-13 01:40:22,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14721974] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:40:22,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804415248] [2022-12-13 01:40:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:40:22,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:40:22,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:40:22,564 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:40:22,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 01:40:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:40:22,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 01:40:22,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:40:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:40:22,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:40:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:40:23,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804415248] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:40:23,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:40:23,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2022-12-13 01:40:23,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975436452] [2022-12-13 01:40:23,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:40:23,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:40:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:40:23,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:40:23,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:40:23,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 137 [2022-12-13 01:40:23,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 1462 transitions, 52605 flow. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:40:23,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:40:23,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 137 [2022-12-13 01:40:23,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:40:29,152 INFO L130 PetriNetUnfolder]: 5414/8932 cut-off events. [2022-12-13 01:40:29,153 INFO L131 PetriNetUnfolder]: For 444991/444991 co-relation queries the response was YES. [2022-12-13 01:40:29,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138091 conditions, 8932 events. 5414/8932 cut-off events. For 444991/444991 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 58908 event pairs, 124 based on Foata normal form. 1/8911 useless extension candidates. Maximal degree in co-relation 137260. Up to 8809 conditions per place. [2022-12-13 01:40:29,265 INFO L137 encePairwiseOnDemand]: 59/137 looper letters, 1366 selfloop transitions, 125 changer transitions 5/1496 dead transitions. [2022-12-13 01:40:29,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 1496 transitions, 56506 flow [2022-12-13 01:40:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:40:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:40:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2022-12-13 01:40:29,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13949716139497162 [2022-12-13 01:40:29,267 INFO L175 Difference]: Start difference. First operand has 357 places, 1462 transitions, 52605 flow. Second operand 9 states and 172 transitions. [2022-12-13 01:40:29,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 1496 transitions, 56506 flow [2022-12-13 01:40:35,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 1496 transitions, 55964 flow, removed 235 selfloop flow, removed 1 redundant places. [2022-12-13 01:40:35,264 INFO L231 Difference]: Finished difference. Result has 367 places, 1472 transitions, 52679 flow [2022-12-13 01:40:35,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=52063, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=52679, PETRI_PLACES=367, PETRI_TRANSITIONS=1472} [2022-12-13 01:40:35,266 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 348 predicate places. [2022-12-13 01:40:35,266 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:40:35,266 INFO L89 Accepts]: Start accepts. Operand has 367 places, 1472 transitions, 52679 flow [2022-12-13 01:40:35,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:40:35,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:40:35,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 367 places, 1472 transitions, 52679 flow [2022-12-13 01:40:35,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 1472 transitions, 52679 flow [2022-12-13 01:40:36,748 INFO L130 PetriNetUnfolder]: 1817/3615 cut-off events. [2022-12-13 01:40:36,748 INFO L131 PetriNetUnfolder]: For 225348/230603 co-relation queries the response was YES. [2022-12-13 01:40:36,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62040 conditions, 3615 events. 1817/3615 cut-off events. For 225348/230603 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 25754 event pairs, 54 based on Foata normal form. 0/3605 useless extension candidates. Maximal degree in co-relation 61673. Up to 2656 conditions per place. [2022-12-13 01:40:36,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 367 places, 1472 transitions, 52679 flow [2022-12-13 01:40:36,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 3212 [2022-12-13 01:40:36,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] L40-1-->L40-1: Formula: (let ((.cse0 (+ v_~n~0_481 1))) (and (not (< v_~j1~0_962 v_~m~0_541)) (< v_~i1~0_791 .cse0) (= v_~i1~0_791 (+ v_~i1~0_793 2)) (< v_~j1~0_962 (+ v_~m~0_541 1)) (= v_~k2~0_795 (+ (* 3 v_~m~0_541) v_~k2~0_796)) (<= v_~m~0_541 3) (= (+ v_~k1~0_944 6) v_~k1~0_942) (= (+ 3 v_~i2~0_786) v_~i2~0_785) (< 2 v_~m~0_541) (< v_~i2~0_785 .cse0))) InVars {~m~0=v_~m~0_541, ~k1~0=v_~k1~0_944, ~k2~0=v_~k2~0_796, ~i2~0=v_~i2~0_786, ~i1~0=v_~i1~0_793, ~n~0=v_~n~0_481} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_449|, ~m~0=v_~m~0_541, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_542|, ~k1~0=v_~k1~0_942, ~k2~0=v_~k2~0_795, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_544|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_359|, ~j1~0=v_~j1~0_962, ~i2~0=v_~i2~0_785, ~i1~0=v_~i1~0_791, ~n~0=v_~n~0_481} 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-13 01:40:36,995 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-13 01:40:37,039 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:40:37,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1773 [2022-12-13 01:40:37,040 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 1472 transitions, 52758 flow [2022-12-13 01:40:37,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:40:37,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:40:37,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:40:37,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 01:40:37,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-13 01:40:37,245 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:40:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:40:37,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1965021623, now seen corresponding path program 1 times [2022-12-13 01:40:37,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:40:37,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322033104] [2022-12-13 01:40:37,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:40:37,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:40:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:40:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:40:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:40:37,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322033104] [2022-12-13 01:40:37,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322033104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:40:37,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322287543] [2022-12-13 01:40:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:40:37,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:40:37,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:40:37,498 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:40:37,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 01:40:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:40:37,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 01:40:37,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:40:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:40:38,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:40:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:40:38,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322287543] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:40:38,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:40:38,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2022-12-13 01:40:38,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686064582] [2022-12-13 01:40:38,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:40:38,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 01:40:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:40:38,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 01:40:38,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-12-13 01:40:38,307 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 140 [2022-12-13 01:40:38,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 1472 transitions, 52758 flow. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:40:38,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:40:38,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 140 [2022-12-13 01:40:38,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:40:42,318 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-13 01:40:44,409 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 [] [2022-12-13 01:40:46,417 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 [] [2022-12-13 01:40:48,425 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-13 01:40:51,162 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-13 01:40:53,210 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-13 01:40:55,220 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 [] [2022-12-13 01:40:57,508 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 [] [2022-12-13 01:40:59,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:41:04,699 INFO L130 PetriNetUnfolder]: 5546/9185 cut-off events. [2022-12-13 01:41:04,699 INFO L131 PetriNetUnfolder]: For 451265/451265 co-relation queries the response was YES. [2022-12-13 01:41:04,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141118 conditions, 9185 events. 5546/9185 cut-off events. For 451265/451265 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 61232 event pairs, 112 based on Foata normal form. 3/9166 useless extension candidates. Maximal degree in co-relation 140266. Up to 8666 conditions per place. [2022-12-13 01:41:04,816 INFO L137 encePairwiseOnDemand]: 46/140 looper letters, 1347 selfloop transitions, 213 changer transitions 16/1576 dead transitions. [2022-12-13 01:41:04,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 1576 transitions, 58623 flow [2022-12-13 01:41:04,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 01:41:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 01:41:04,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 212 transitions. [2022-12-13 01:41:04,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10095238095238095 [2022-12-13 01:41:04,818 INFO L175 Difference]: Start difference. First operand has 367 places, 1472 transitions, 52758 flow. Second operand 15 states and 212 transitions. [2022-12-13 01:41:04,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 1576 transitions, 58623 flow [2022-12-13 01:41:11,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 1576 transitions, 58426 flow, removed 59 selfloop flow, removed 2 redundant places. [2022-12-13 01:41:11,861 INFO L231 Difference]: Finished difference. Result has 387 places, 1509 transitions, 54381 flow [2022-12-13 01:41:11,862 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=52561, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=54381, PETRI_PLACES=387, PETRI_TRANSITIONS=1509} [2022-12-13 01:41:11,862 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 368 predicate places. [2022-12-13 01:41:11,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:41:11,862 INFO L89 Accepts]: Start accepts. Operand has 387 places, 1509 transitions, 54381 flow [2022-12-13 01:41:11,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:41:11,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:41:11,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 387 places, 1509 transitions, 54381 flow [2022-12-13 01:41:11,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 386 places, 1509 transitions, 54381 flow [2022-12-13 01:41:13,281 INFO L130 PetriNetUnfolder]: 1855/3718 cut-off events. [2022-12-13 01:41:13,281 INFO L131 PetriNetUnfolder]: For 230842/234396 co-relation queries the response was YES. [2022-12-13 01:41:13,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64201 conditions, 3718 events. 1855/3718 cut-off events. For 230842/234396 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 26852 event pairs, 55 based on Foata normal form. 4/3713 useless extension candidates. Maximal degree in co-relation 63805. Up to 2729 conditions per place. [2022-12-13 01:41:13,360 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 386 places, 1509 transitions, 54381 flow [2022-12-13 01:41:13,361 INFO L226 LiptonReduction]: Number of co-enabled transitions 3292 [2022-12-13 01:41:13,362 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L41-6-->L41-6: Formula: (and (= v_~i2~0_593 (+ v_~i2~0_594 1)) (= v_~j1~0_763 1) (< 0 v_~m~0_443) (not (< v_~j1~0_765 v_~m~0_443)) (= (+ v_~i1~0_636 1) v_~i1~0_635) (= v_~k1~0_739 (+ v_~k1~0_740 1)) (= v_~k2~0_596 (+ v_~k2~0_597 v_~m~0_443)) (< v_~i1~0_635 v_~n~0_395) (< v_~i2~0_594 v_~n~0_395)) InVars {~m~0=v_~m~0_443, ~k1~0=v_~k1~0_740, ~k2~0=v_~k2~0_597, ~j1~0=v_~j1~0_765, ~i2~0=v_~i2~0_594, ~i1~0=v_~i1~0_636, ~n~0=v_~n~0_395} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_328|, ~m~0=v_~m~0_443, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_421|, ~k1~0=v_~k1~0_739, ~k2~0=v_~k2~0_596, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_423|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_278|, ~j1~0=v_~j1~0_763, ~i2~0=v_~i2~0_593, ~i1~0=v_~i1~0_635, ~n~0=v_~n~0_395} 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-13 01:41:13,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [658] L40-1-->L51-1: Formula: (and (< v_~j1~0_1015 (+ v_~m~0_567 1)) (= (+ v_~k1~0_1009 1) v_~k1~0_1008) (< v_~i2~0_818 v_~n~0_503) (= v_~k2~0_829 (+ v_~k2~0_830 v_~m~0_567)) (= v_~j1~0_1015 1) (not (< v_~j1~0_1015 v_~m~0_567)) (< v_~i1~0_836 v_~n~0_503) (= v_~i2~0_817 (+ v_~i2~0_818 1)) (= v_~i1~0_835 (+ v_~i1~0_836 1))) InVars {~m~0=v_~m~0_567, ~k2~0=v_~k2~0_830, ~k1~0=v_~k1~0_1009, ~i2~0=v_~i2~0_818, ~i1~0=v_~i1~0_836, ~n~0=v_~n~0_503} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_468|, ~m~0=v_~m~0_567, ~k2~0=v_~k2~0_829, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_581|, ~k1~0=v_~k1~0_1008, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_583|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_382|, ~i2~0=v_~i2~0_817, ~j1~0=v_~j1~0_1015, ~i1~0=v_~i1~0_835, ~n~0=v_~n~0_503} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~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-13 01:41:13,691 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:41:13,748 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:41:13,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1887 [2022-12-13 01:41:13,749 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 1509 transitions, 54515 flow [2022-12-13 01:41:13,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:41:13,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:41:13,749 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:41:13,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 01:41:13,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 01:41:13,950 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:41:13,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:41:13,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1610280419, now seen corresponding path program 1 times [2022-12-13 01:41:13,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:41:13,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976275333] [2022-12-13 01:41:13,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:41:13,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:41:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:41:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 01:41:13,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:41:13,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976275333] [2022-12-13 01:41:13,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976275333] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:41:13,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882309759] [2022-12-13 01:41:13,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:41:13,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:41:13,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:41:13,998 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:41:14,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 01:41:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:41:14,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:41:14,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:41:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 01:41:14,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:41:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 01:41:14,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882309759] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:41:14,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:41:14,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 01:41:14,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439912244] [2022-12-13 01:41:14,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:41:14,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:41:14,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:41:14,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:41:14,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:41:14,148 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 144 [2022-12-13 01:41:14,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 1509 transitions, 54515 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:41:14,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:41:14,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 144 [2022-12-13 01:41:14,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:41:20,241 INFO L130 PetriNetUnfolder]: 6221/10232 cut-off events. [2022-12-13 01:41:20,242 INFO L131 PetriNetUnfolder]: For 528848/528848 co-relation queries the response was YES. [2022-12-13 01:41:20,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159147 conditions, 10232 events. 6221/10232 cut-off events. For 528848/528848 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 68921 event pairs, 126 based on Foata normal form. 12/10222 useless extension candidates. Maximal degree in co-relation 157749. Up to 6353 conditions per place. [2022-12-13 01:41:20,379 INFO L137 encePairwiseOnDemand]: 36/144 looper letters, 1119 selfloop transitions, 668 changer transitions 2/1789 dead transitions. [2022-12-13 01:41:20,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 1789 transitions, 67804 flow [2022-12-13 01:41:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:41:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:41:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2022-12-13 01:41:20,381 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1294191919191919 [2022-12-13 01:41:20,381 INFO L175 Difference]: Start difference. First operand has 386 places, 1509 transitions, 54515 flow. Second operand 11 states and 205 transitions. [2022-12-13 01:41:20,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 1789 transitions, 67804 flow [2022-12-13 01:41:28,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 1789 transitions, 67334 flow, removed 189 selfloop flow, removed 3 redundant places. [2022-12-13 01:41:28,654 INFO L231 Difference]: Finished difference. Result has 397 places, 1597 transitions, 60686 flow [2022-12-13 01:41:28,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=54093, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=585, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=898, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=60686, PETRI_PLACES=397, PETRI_TRANSITIONS=1597} [2022-12-13 01:41:28,655 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 378 predicate places. [2022-12-13 01:41:28,655 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:41:28,655 INFO L89 Accepts]: Start accepts. Operand has 397 places, 1597 transitions, 60686 flow [2022-12-13 01:41:28,664 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:41:28,664 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:41:28,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 397 places, 1597 transitions, 60686 flow [2022-12-13 01:41:28,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 396 places, 1597 transitions, 60686 flow [2022-12-13 01:41:30,336 INFO L130 PetriNetUnfolder]: 2097/4144 cut-off events. [2022-12-13 01:41:30,336 INFO L131 PetriNetUnfolder]: For 294149/299006 co-relation queries the response was YES. [2022-12-13 01:41:30,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73634 conditions, 4144 events. 2097/4144 cut-off events. For 294149/299006 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 30238 event pairs, 62 based on Foata normal form. 4/4138 useless extension candidates. Maximal degree in co-relation 73158. Up to 3100 conditions per place. [2022-12-13 01:41:30,435 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 396 places, 1597 transitions, 60686 flow [2022-12-13 01:41:30,435 INFO L226 LiptonReduction]: Number of co-enabled transitions 3468 [2022-12-13 01:41:30,439 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:41:30,440 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1785 [2022-12-13 01:41:30,440 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 1597 transitions, 60686 flow [2022-12-13 01:41:30,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:41:30,440 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:41:30,440 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:41:30,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 01:41:30,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 01:41:30,641 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:41:30,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:41:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash -356168258, now seen corresponding path program 1 times [2022-12-13 01:41:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:41:30,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857463321] [2022-12-13 01:41:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:41:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:41:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:41:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:41:30,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:41:30,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857463321] [2022-12-13 01:41:30,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857463321] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:41:30,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443763288] [2022-12-13 01:41:30,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:41:30,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:41:30,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:41:30,684 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:41:30,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 01:41:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:41:30,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 01:41:30,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:41:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:41:30,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:41:30,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443763288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:41:30,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:41:30,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-13 01:41:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695609326] [2022-12-13 01:41:30,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:41:30,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:41:30,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:41:30,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:41:30,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:41:30,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 143 [2022-12-13 01:41:30,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 1597 transitions, 60686 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:41:30,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:41:30,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 143 [2022-12-13 01:41:30,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:41:37,295 INFO L130 PetriNetUnfolder]: 6269/10388 cut-off events. [2022-12-13 01:41:37,295 INFO L131 PetriNetUnfolder]: For 618459/618459 co-relation queries the response was YES. [2022-12-13 01:41:37,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164846 conditions, 10388 events. 6269/10388 cut-off events. For 618459/618459 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 70692 event pairs, 1728 based on Foata normal form. 20/10386 useless extension candidates. Maximal degree in co-relation 163401. Up to 8311 conditions per place. [2022-12-13 01:41:37,447 INFO L137 encePairwiseOnDemand]: 124/143 looper letters, 1638 selfloop transitions, 42 changer transitions 5/1685 dead transitions. [2022-12-13 01:41:37,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 1685 transitions, 67733 flow [2022-12-13 01:41:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:41:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:41:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-12-13 01:41:37,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2022-12-13 01:41:37,448 INFO L175 Difference]: Start difference. First operand has 396 places, 1597 transitions, 60686 flow. Second operand 4 states and 169 transitions. [2022-12-13 01:41:37,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 1685 transitions, 67733 flow [2022-12-13 01:41:45,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1685 transitions, 67262 flow, removed 188 selfloop flow, removed 3 redundant places. [2022-12-13 01:41:45,733 INFO L231 Difference]: Finished difference. Result has 396 places, 1533 transitions, 58266 flow [2022-12-13 01:41:45,734 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=57306, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58266, PETRI_PLACES=396, PETRI_TRANSITIONS=1533} [2022-12-13 01:41:45,734 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 377 predicate places. [2022-12-13 01:41:45,734 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:41:45,734 INFO L89 Accepts]: Start accepts. Operand has 396 places, 1533 transitions, 58266 flow [2022-12-13 01:41:45,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:41:45,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:41:45,746 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 396 places, 1533 transitions, 58266 flow [2022-12-13 01:41:45,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 396 places, 1533 transitions, 58266 flow [2022-12-13 01:41:47,317 INFO L130 PetriNetUnfolder]: 2102/4222 cut-off events. [2022-12-13 01:41:47,318 INFO L131 PetriNetUnfolder]: For 293544/296096 co-relation queries the response was YES. [2022-12-13 01:41:47,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74638 conditions, 4222 events. 2102/4222 cut-off events. For 293544/296096 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 31319 event pairs, 82 based on Foata normal form. 6/4218 useless extension candidates. Maximal degree in co-relation 74104. Up to 3141 conditions per place. [2022-12-13 01:41:47,412 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 396 places, 1533 transitions, 58266 flow [2022-12-13 01:41:47,412 INFO L226 LiptonReduction]: Number of co-enabled transitions 3340 [2022-12-13 01:41:48,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] L40-1-->L40-1: Formula: (let ((.cse0 (+ v_~n~0_481 1))) (and (not (< v_~j1~0_962 v_~m~0_541)) (< v_~i1~0_791 .cse0) (= v_~i1~0_791 (+ v_~i1~0_793 2)) (< v_~j1~0_962 (+ v_~m~0_541 1)) (= v_~k2~0_795 (+ (* 3 v_~m~0_541) v_~k2~0_796)) (<= v_~m~0_541 3) (= (+ v_~k1~0_944 6) v_~k1~0_942) (= (+ 3 v_~i2~0_786) v_~i2~0_785) (< 2 v_~m~0_541) (< v_~i2~0_785 .cse0))) InVars {~m~0=v_~m~0_541, ~k1~0=v_~k1~0_944, ~k2~0=v_~k2~0_796, ~i2~0=v_~i2~0_786, ~i1~0=v_~i1~0_793, ~n~0=v_~n~0_481} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_449|, ~m~0=v_~m~0_541, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_542|, ~k1~0=v_~k1~0_942, ~k2~0=v_~k2~0_795, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_544|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_359|, ~j1~0=v_~j1~0_962, ~i2~0=v_~i2~0_785, ~i1~0=v_~i1~0_791, ~n~0=v_~n~0_481} 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 [684] L51-1-->L41-6: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_91| 0) (= (+ 3 v_~k1~0_1126) v_~k1~0_1125) (= v_~j1~0_1126 3) (< v_~i1~0_905 v_~n~0_553) (< v_~j1~0_1126 (+ v_~m~0_619 1)) (not (< v_~i2~0_873 v_~n~0_553)) (= |v_thread2Thread1of1ForFork1_#res.base_91| 0)) InVars {~m~0=v_~m~0_619, ~k1~0=v_~k1~0_1126, ~i2~0=v_~i2~0_873, ~i1~0=v_~i1~0_905, ~n~0=v_~n~0_553} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_91|, ~m~0=v_~m~0_619, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_646|, ~k1~0=v_~k1~0_1125, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_648|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_91|, ~j1~0=v_~j1~0_1126, ~i2~0=v_~i2~0_873, ~i1~0=v_~i1~0_905, ~n~0=v_~n~0_553} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-13 01:41:48,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] L40-1-->L40-1: Formula: (let ((.cse0 (+ v_~n~0_481 1))) (and (not (< v_~j1~0_962 v_~m~0_541)) (< v_~i1~0_791 .cse0) (= v_~i1~0_791 (+ v_~i1~0_793 2)) (< v_~j1~0_962 (+ v_~m~0_541 1)) (= v_~k2~0_795 (+ (* 3 v_~m~0_541) v_~k2~0_796)) (<= v_~m~0_541 3) (= (+ v_~k1~0_944 6) v_~k1~0_942) (= (+ 3 v_~i2~0_786) v_~i2~0_785) (< 2 v_~m~0_541) (< v_~i2~0_785 .cse0))) InVars {~m~0=v_~m~0_541, ~k1~0=v_~k1~0_944, ~k2~0=v_~k2~0_796, ~i2~0=v_~i2~0_786, ~i1~0=v_~i1~0_793, ~n~0=v_~n~0_481} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_449|, ~m~0=v_~m~0_541, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_542|, ~k1~0=v_~k1~0_942, ~k2~0=v_~k2~0_795, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_544|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_359|, ~j1~0=v_~j1~0_962, ~i2~0=v_~i2~0_785, ~i1~0=v_~i1~0_791, ~n~0=v_~n~0_481} 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 [691] L51-1-->L41-6: Formula: (and (< v_~i1~0_921 v_~n~0_567) (= (+ 3 v_~k1~0_1154) v_~k1~0_1153) (= |v_thread2Thread1of1ForFork1_#res.offset_99| 0) (< v_~j1~0_1156 (+ v_~m~0_633 1)) (not (< v_~i2~0_881 v_~n~0_567)) (= |v_thread2Thread1of1ForFork1_#res.base_99| 0) (= v_~j1~0_1156 3)) InVars {~m~0=v_~m~0_633, ~k1~0=v_~k1~0_1154, ~i2~0=v_~i2~0_881, ~i1~0=v_~i1~0_921, ~n~0=v_~n~0_567} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_99|, ~m~0=v_~m~0_633, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_660|, ~k1~0=v_~k1~0_1153, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_662|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_99|, ~j1~0=v_~j1~0_1156, ~i2~0=v_~i2~0_881, ~i1~0=v_~i1~0_921, ~n~0=v_~n~0_567} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-13 01:41:49,155 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:41:49,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3422 [2022-12-13 01:41:49,156 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 1539 transitions, 58799 flow [2022-12-13 01:41:49,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:41:49,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:41:49,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:41:49,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 01:41:49,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:41:49,356 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:41:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:41:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash 75745256, now seen corresponding path program 1 times [2022-12-13 01:41:49,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:41:49,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838443277] [2022-12-13 01:41:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:41:49,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:41:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:41:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:41:49,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:41:49,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838443277] [2022-12-13 01:41:49,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838443277] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:41:49,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648756363] [2022-12-13 01:41:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:41:49,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:41:49,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:41:49,409 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:41:49,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 01:41:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:41:49,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:41:49,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:41:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:41:49,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:41:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:41:49,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648756363] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:41:49,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:41:49,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 01:41:49,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630323186] [2022-12-13 01:41:49,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:41:49,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:41:49,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:41:49,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:41:49,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:41:49,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 156 [2022-12-13 01:41:49,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 1539 transitions, 58799 flow. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:41:49,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:41:49,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 156 [2022-12-13 01:41:49,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:41:57,800 INFO L130 PetriNetUnfolder]: 7403/12280 cut-off events. [2022-12-13 01:41:57,800 INFO L131 PetriNetUnfolder]: For 718128/718128 co-relation queries the response was YES. [2022-12-13 01:41:57,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196047 conditions, 12280 events. 7403/12280 cut-off events. For 718128/718128 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 85700 event pairs, 86 based on Foata normal form. 58/12316 useless extension candidates. Maximal degree in co-relation 195064. Up to 7751 conditions per place. [2022-12-13 01:41:57,982 INFO L137 encePairwiseOnDemand]: 44/156 looper letters, 1003 selfloop transitions, 994 changer transitions 9/2006 dead transitions. [2022-12-13 01:41:57,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 2006 transitions, 80104 flow [2022-12-13 01:41:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 01:41:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 01:41:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 246 transitions. [2022-12-13 01:41:57,984 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10512820512820513 [2022-12-13 01:41:57,984 INFO L175 Difference]: Start difference. First operand has 396 places, 1539 transitions, 58799 flow. Second operand 15 states and 246 transitions. [2022-12-13 01:41:57,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 2006 transitions, 80104 flow [2022-12-13 01:42:08,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 2006 transitions, 79724 flow, removed 66 selfloop flow, removed 2 redundant places. [2022-12-13 01:42:08,213 INFO L231 Difference]: Finished difference. Result has 417 places, 1686 transitions, 68739 flow [2022-12-13 01:42:08,213 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=57717, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=840, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=68739, PETRI_PLACES=417, PETRI_TRANSITIONS=1686} [2022-12-13 01:42:08,214 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 398 predicate places. [2022-12-13 01:42:08,214 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:08,214 INFO L89 Accepts]: Start accepts. Operand has 417 places, 1686 transitions, 68739 flow [2022-12-13 01:42:08,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:08,226 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:08,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 417 places, 1686 transitions, 68739 flow [2022-12-13 01:42:08,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 417 places, 1686 transitions, 68739 flow [2022-12-13 01:42:10,519 INFO L130 PetriNetUnfolder]: 2472/4956 cut-off events. [2022-12-13 01:42:10,519 INFO L131 PetriNetUnfolder]: For 404425/407190 co-relation queries the response was YES. [2022-12-13 01:42:10,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93204 conditions, 4956 events. 2472/4956 cut-off events. For 404425/407190 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 37908 event pairs, 119 based on Foata normal form. 5/4949 useless extension candidates. Maximal degree in co-relation 92755. Up to 3802 conditions per place. [2022-12-13 01:42:10,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 417 places, 1686 transitions, 68739 flow [2022-12-13 01:42:10,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 3646 [2022-12-13 01:42:10,650 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:10,652 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2438 [2022-12-13 01:42:10,652 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 1686 transitions, 68739 flow [2022-12-13 01:42:10,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:42:10,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:10,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:42:10,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 01:42:10,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 01:42:10,861 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:42:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:10,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1516108951, now seen corresponding path program 1 times [2022-12-13 01:42:10,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:10,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921406024] [2022-12-13 01:42:10,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:10,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 01:42:10,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:10,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921406024] [2022-12-13 01:42:10,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921406024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:10,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:10,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:42:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510699207] [2022-12-13 01:42:10,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:10,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:42:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:10,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:42:10,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:42:10,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 144 [2022-12-13 01:42:10,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1686 transitions, 68739 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:42:10,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:10,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 144 [2022-12-13 01:42:10,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:19,352 INFO L130 PetriNetUnfolder]: 7451/12343 cut-off events. [2022-12-13 01:42:19,352 INFO L131 PetriNetUnfolder]: For 836309/836309 co-relation queries the response was YES. [2022-12-13 01:42:19,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206232 conditions, 12343 events. 7451/12343 cut-off events. For 836309/836309 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 85750 event pairs, 462 based on Foata normal form. 2/12317 useless extension candidates. Maximal degree in co-relation 204997. Up to 11060 conditions per place. [2022-12-13 01:42:19,530 INFO L137 encePairwiseOnDemand]: 83/144 looper letters, 1613 selfloop transitions, 131 changer transitions 3/1747 dead transitions. [2022-12-13 01:42:19,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1747 transitions, 74456 flow [2022-12-13 01:42:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:42:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:42:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-12-13 01:42:19,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2673611111111111 [2022-12-13 01:42:19,531 INFO L175 Difference]: Start difference. First operand has 417 places, 1686 transitions, 68739 flow. Second operand 4 states and 154 transitions. [2022-12-13 01:42:19,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1747 transitions, 74456 flow [2022-12-13 01:42:30,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 1747 transitions, 73618 flow, removed 367 selfloop flow, removed 4 redundant places. [2022-12-13 01:42:30,761 INFO L231 Difference]: Finished difference. Result has 417 places, 1698 transitions, 68818 flow [2022-12-13 01:42:30,762 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=67874, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68818, PETRI_PLACES=417, PETRI_TRANSITIONS=1698} [2022-12-13 01:42:30,762 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 398 predicate places. [2022-12-13 01:42:30,762 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:30,762 INFO L89 Accepts]: Start accepts. Operand has 417 places, 1698 transitions, 68818 flow [2022-12-13 01:42:30,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:30,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:30,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 417 places, 1698 transitions, 68818 flow [2022-12-13 01:42:30,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 417 places, 1698 transitions, 68818 flow [2022-12-13 01:42:33,303 INFO L130 PetriNetUnfolder]: 2495/4994 cut-off events. [2022-12-13 01:42:33,303 INFO L131 PetriNetUnfolder]: For 394806/396893 co-relation queries the response was YES. [2022-12-13 01:42:33,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93518 conditions, 4994 events. 2495/4994 cut-off events. For 394806/396893 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 37976 event pairs, 126 based on Foata normal form. 8/4990 useless extension candidates. Maximal degree in co-relation 93004. Up to 3842 conditions per place. [2022-12-13 01:42:33,429 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 417 places, 1698 transitions, 68818 flow [2022-12-13 01:42:33,430 INFO L226 LiptonReduction]: Number of co-enabled transitions 3670 [2022-12-13 01:42:33,434 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:33,434 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2672 [2022-12-13 01:42:33,434 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 1698 transitions, 68818 flow [2022-12-13 01:42:33,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:42:33,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:33,434 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:42:33,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 01:42:33,435 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:42:33,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1168982993, now seen corresponding path program 1 times [2022-12-13 01:42:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:33,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676260424] [2022-12-13 01:42:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:33,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:42:33,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:33,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676260424] [2022-12-13 01:42:33,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676260424] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:42:33,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636846050] [2022-12-13 01:42:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:33,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:42:33,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:42:33,694 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:42:33,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 01:42:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:33,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 01:42:33,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:42:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:42:34,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:42:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:42:34,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636846050] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:42:34,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:42:34,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 12 [2022-12-13 01:42:34,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323303355] [2022-12-13 01:42:34,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:42:34,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 01:42:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:34,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 01:42:34,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-13 01:42:34,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 143 [2022-12-13 01:42:34,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1698 transitions, 68818 flow. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:42:34,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:34,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 143 [2022-12-13 01:42:34,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:38,559 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 [] [2022-12-13 01:42:46,916 INFO L130 PetriNetUnfolder]: 7527/12476 cut-off events. [2022-12-13 01:42:46,916 INFO L131 PetriNetUnfolder]: For 802732/802732 co-relation queries the response was YES. [2022-12-13 01:42:47,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207214 conditions, 12476 events. 7527/12476 cut-off events. For 802732/802732 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 87266 event pairs, 242 based on Foata normal form. 2/12450 useless extension candidates. Maximal degree in co-relation 205565. Up to 10497 conditions per place. [2022-12-13 01:42:47,110 INFO L137 encePairwiseOnDemand]: 35/143 looper letters, 982 selfloop transitions, 793 changer transitions 12/1787 dead transitions. [2022-12-13 01:42:47,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 1787 transitions, 74865 flow [2022-12-13 01:42:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 01:42:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 01:42:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 216 transitions. [2022-12-13 01:42:47,112 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.0944055944055944 [2022-12-13 01:42:47,112 INFO L175 Difference]: Start difference. First operand has 417 places, 1698 transitions, 68818 flow. Second operand 16 states and 216 transitions. [2022-12-13 01:42:47,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 1787 transitions, 74865 flow [2022-12-13 01:42:58,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 1787 transitions, 74729 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-13 01:42:58,202 INFO L231 Difference]: Finished difference. Result has 438 places, 1749 transitions, 73853 flow [2022-12-13 01:42:58,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=68691, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=747, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=73853, PETRI_PLACES=438, PETRI_TRANSITIONS=1749} [2022-12-13 01:42:58,204 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 419 predicate places. [2022-12-13 01:42:58,204 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:58,204 INFO L89 Accepts]: Start accepts. Operand has 438 places, 1749 transitions, 73853 flow [2022-12-13 01:42:58,215 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:58,215 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:58,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 438 places, 1749 transitions, 73853 flow [2022-12-13 01:42:58,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 438 places, 1749 transitions, 73853 flow [2022-12-13 01:43:00,825 INFO L130 PetriNetUnfolder]: 2519/5045 cut-off events. [2022-12-13 01:43:00,826 INFO L131 PetriNetUnfolder]: For 429724/433578 co-relation queries the response was YES. [2022-12-13 01:43:00,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97116 conditions, 5045 events. 2519/5045 cut-off events. For 429724/433578 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 38602 event pairs, 118 based on Foata normal form. 8/5042 useless extension candidates. Maximal degree in co-relation 96590. Up to 3883 conditions per place. [2022-12-13 01:43:00,959 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 438 places, 1749 transitions, 73853 flow [2022-12-13 01:43:00,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 3778 [2022-12-13 01:43:00,966 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L40-1-->L41-6: Formula: (and (< v_~i1~0_855 v_~n~0_513) (<= v_~m~0_579 1) (= (+ v_~i1~0_856 1) v_~i1~0_855) (< v_~i2~0_847 v_~n~0_513) (= (+ v_~k2~0_862 v_~m~0_579) v_~k2~0_861) (< 0 v_~m~0_579) (= v_~i2~0_846 (+ v_~i2~0_847 1)) (= (+ v_~k1~0_1045 1) v_~k1~0_1044) (= v_~j1~0_1042 0)) InVars {~m~0=v_~m~0_579, ~k2~0=v_~k2~0_862, ~k1~0=v_~k1~0_1045, ~i2~0=v_~i2~0_847, ~i1~0=v_~i1~0_856, ~n~0=v_~n~0_513} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_489|, ~m~0=v_~m~0_579, ~k2~0=v_~k2~0_861, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_602|, ~k1~0=v_~k1~0_1044, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_604|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_396|, ~j1~0=v_~j1~0_1042, ~i2~0=v_~i2~0_846, ~i1~0=v_~i1~0_855, ~n~0=v_~n~0_513} 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-13 01:43:01,203 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:01,204 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3000 [2022-12-13 01:43:01,204 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 1749 transitions, 73935 flow [2022-12-13 01:43:01,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:01,204 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:01,204 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:01,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-13 01:43:01,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 01:43:01,405 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:43:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:01,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1467779811, now seen corresponding path program 1 times [2022-12-13 01:43:01,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:01,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233747155] [2022-12-13 01:43:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:01,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:43:01,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:01,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233747155] [2022-12-13 01:43:01,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233747155] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:43:01,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325485955] [2022-12-13 01:43:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:01,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:01,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:43:01,481 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:43:01,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 01:43:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:01,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:43:01,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:43:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:43:01,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:43:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:43:01,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325485955] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:43:01,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:43:01,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-13 01:43:01,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507949050] [2022-12-13 01:43:01,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:43:01,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:43:01,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:01,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:43:01,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:43:01,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 145 [2022-12-13 01:43:01,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 1749 transitions, 73935 flow. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:01,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:01,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 145 [2022-12-13 01:43:01,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:15,736 INFO L130 PetriNetUnfolder]: 11081/18558 cut-off events. [2022-12-13 01:43:15,736 INFO L131 PetriNetUnfolder]: For 1412738/1412738 co-relation queries the response was YES. [2022-12-13 01:43:15,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318762 conditions, 18558 events. 11081/18558 cut-off events. For 1412738/1412738 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 136311 event pairs, 196 based on Foata normal form. 240/18770 useless extension candidates. Maximal degree in co-relation 317787. Up to 11977 conditions per place. [2022-12-13 01:43:16,029 INFO L137 encePairwiseOnDemand]: 22/145 looper letters, 1368 selfloop transitions, 1295 changer transitions 26/2689 dead transitions. [2022-12-13 01:43:16,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 2689 transitions, 118820 flow [2022-12-13 01:43:16,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 01:43:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 01:43:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 295 transitions. [2022-12-13 01:43:16,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.09247648902821316 [2022-12-13 01:43:16,031 INFO L175 Difference]: Start difference. First operand has 438 places, 1749 transitions, 73935 flow. Second operand 22 states and 295 transitions. [2022-12-13 01:43:16,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 2689 transitions, 118820 flow [2022-12-13 01:43:37,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 2689 transitions, 118013 flow, removed 313 selfloop flow, removed 5 redundant places. [2022-12-13 01:43:37,189 INFO L231 Difference]: Finished difference. Result has 469 places, 2106 transitions, 95518 flow [2022-12-13 01:43:37,190 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=73194, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1749, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=964, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=95518, PETRI_PLACES=469, PETRI_TRANSITIONS=2106} [2022-12-13 01:43:37,190 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 450 predicate places. [2022-12-13 01:43:37,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:37,190 INFO L89 Accepts]: Start accepts. Operand has 469 places, 2106 transitions, 95518 flow [2022-12-13 01:43:37,211 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:37,211 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:37,211 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 469 places, 2106 transitions, 95518 flow [2022-12-13 01:43:37,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 468 places, 2106 transitions, 95518 flow [2022-12-13 01:43:41,657 INFO L130 PetriNetUnfolder]: 3639/7438 cut-off events. [2022-12-13 01:43:41,657 INFO L131 PetriNetUnfolder]: For 739944/743061 co-relation queries the response was YES. [2022-12-13 01:43:41,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150434 conditions, 7438 events. 3639/7438 cut-off events. For 739944/743061 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 60208 event pairs, 259 based on Foata normal form. 10/7437 useless extension candidates. Maximal degree in co-relation 149966. Up to 5845 conditions per place. [2022-12-13 01:43:42,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 468 places, 2106 transitions, 95518 flow [2022-12-13 01:43:42,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 4492 [2022-12-13 01:43:42,191 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-13 01:43:42,297 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:42,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5108 [2022-12-13 01:43:42,298 INFO L495 AbstractCegarLoop]: Abstraction has has 468 places, 2106 transitions, 95562 flow [2022-12-13 01:43:42,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:42,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:42,298 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:42,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 01:43:42,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:42,499 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:43:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:42,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1052263055, now seen corresponding path program 1 times [2022-12-13 01:43:42,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:42,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814372229] [2022-12-13 01:43:42,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:42,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 01:43:42,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:42,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814372229] [2022-12-13 01:43:42,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814372229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:42,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:42,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:43:42,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361733737] [2022-12-13 01:43:42,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:42,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:43:42,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:42,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:43:42,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:43:42,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 146 [2022-12-13 01:43:42,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 2106 transitions, 95562 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:42,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:42,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 146 [2022-12-13 01:43:42,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:58,418 INFO L130 PetriNetUnfolder]: 11046/18526 cut-off events. [2022-12-13 01:43:58,418 INFO L131 PetriNetUnfolder]: For 1547882/1547882 co-relation queries the response was YES. [2022-12-13 01:43:58,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329268 conditions, 18526 events. 11046/18526 cut-off events. For 1547882/1547882 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 135968 event pairs, 1006 based on Foata normal form. 48/18546 useless extension candidates. Maximal degree in co-relation 328194. Up to 12079 conditions per place. [2022-12-13 01:43:58,891 INFO L137 encePairwiseOnDemand]: 65/146 looper letters, 1520 selfloop transitions, 703 changer transitions 8/2231 dead transitions. [2022-12-13 01:43:58,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 2231 transitions, 103948 flow [2022-12-13 01:43:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:43:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:43:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2022-12-13 01:43:58,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17123287671232876 [2022-12-13 01:43:58,893 INFO L175 Difference]: Start difference. First operand has 468 places, 2106 transitions, 95562 flow. Second operand 7 states and 175 transitions. [2022-12-13 01:43:58,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 2231 transitions, 103948 flow [2022-12-13 01:44:22,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 2231 transitions, 102643 flow, removed 530 selfloop flow, removed 5 redundant places. [2022-12-13 01:44:22,410 INFO L231 Difference]: Finished difference. Result has 473 places, 2102 transitions, 96824 flow [2022-12-13 01:44:22,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=93121, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2089, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=689, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96824, PETRI_PLACES=473, PETRI_TRANSITIONS=2102} [2022-12-13 01:44:22,412 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 454 predicate places. [2022-12-13 01:44:22,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:22,412 INFO L89 Accepts]: Start accepts. Operand has 473 places, 2102 transitions, 96824 flow [2022-12-13 01:44:22,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:22,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:22,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 473 places, 2102 transitions, 96824 flow [2022-12-13 01:44:22,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 472 places, 2102 transitions, 96824 flow [2022-12-13 01:44:26,878 INFO L130 PetriNetUnfolder]: 3653/7428 cut-off events. [2022-12-13 01:44:26,878 INFO L131 PetriNetUnfolder]: For 752974/759947 co-relation queries the response was YES. [2022-12-13 01:44:26,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151391 conditions, 7428 events. 3653/7428 cut-off events. For 752974/759947 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 59853 event pairs, 220 based on Foata normal form. 3/7420 useless extension candidates. Maximal degree in co-relation 150895. Up to 5862 conditions per place. [2022-12-13 01:44:27,079 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 472 places, 2102 transitions, 96824 flow [2022-12-13 01:44:27,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 4484 [2022-12-13 01:44:27,085 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:27,085 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4673 [2022-12-13 01:44:27,085 INFO L495 AbstractCegarLoop]: Abstraction has has 472 places, 2102 transitions, 96824 flow [2022-12-13 01:44:27,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:27,085 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:27,085 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:27,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 01:44:27,086 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:44:27,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:27,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1761723267, now seen corresponding path program 1 times [2022-12-13 01:44:27,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:27,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218704736] [2022-12-13 01:44:27,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:27,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:44:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:27,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218704736] [2022-12-13 01:44:27,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218704736] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:44:27,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550011991] [2022-12-13 01:44:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:27,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:44:27,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:44:27,462 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:44:27,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 01:44:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:27,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 01:44:27,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:44:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:44:28,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:44:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:44:30,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550011991] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:44:30,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:44:30,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 16 [2022-12-13 01:44:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050177261] [2022-12-13 01:44:30,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:44:30,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 01:44:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:30,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 01:44:30,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-12-13 01:44:30,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 145 [2022-12-13 01:44:30,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 2102 transitions, 96824 flow. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:30,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:30,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 145 [2022-12-13 01:44:30,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:46,980 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 [] [2022-12-13 01:44:59,166 INFO L130 PetriNetUnfolder]: 11921/19973 cut-off events. [2022-12-13 01:44:59,166 INFO L131 PetriNetUnfolder]: For 1619637/1619637 co-relation queries the response was YES. [2022-12-13 01:44:59,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356510 conditions, 19973 events. 11921/19973 cut-off events. For 1619637/1619637 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 149081 event pairs, 380 based on Foata normal form. 6/19951 useless extension candidates. Maximal degree in co-relation 354942. Up to 15704 conditions per place. [2022-12-13 01:44:59,500 INFO L137 encePairwiseOnDemand]: 14/145 looper letters, 1077 selfloop transitions, 1519 changer transitions 19/2615 dead transitions. [2022-12-13 01:44:59,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 2615 transitions, 121043 flow [2022-12-13 01:44:59,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 01:44:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-12-13 01:44:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 365 transitions. [2022-12-13 01:44:59,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.05244252873563218 [2022-12-13 01:44:59,502 INFO L175 Difference]: Start difference. First operand has 472 places, 2102 transitions, 96824 flow. Second operand 48 states and 365 transitions. [2022-12-13 01:44:59,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 2615 transitions, 121043 flow [2022-12-13 01:45:25,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 2615 transitions, 120759 flow, removed 142 selfloop flow, removed 0 redundant places. [2022-12-13 01:45:25,747 INFO L231 Difference]: Finished difference. Result has 541 places, 2511 transitions, 118936 flow [2022-12-13 01:45:25,749 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=96598, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=118936, PETRI_PLACES=541, PETRI_TRANSITIONS=2511} [2022-12-13 01:45:25,749 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 522 predicate places. [2022-12-13 01:45:25,749 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:25,749 INFO L89 Accepts]: Start accepts. Operand has 541 places, 2511 transitions, 118936 flow [2022-12-13 01:45:25,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:25,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:25,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 541 places, 2511 transitions, 118936 flow [2022-12-13 01:45:25,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 541 places, 2511 transitions, 118936 flow [2022-12-13 01:45:31,739 INFO L130 PetriNetUnfolder]: 3936/8027 cut-off events. [2022-12-13 01:45:31,739 INFO L131 PetriNetUnfolder]: For 830540/834928 co-relation queries the response was YES. [2022-12-13 01:45:31,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169407 conditions, 8027 events. 3936/8027 cut-off events. For 830540/834928 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 65972 event pairs, 190 based on Foata normal form. 15/8032 useless extension candidates. Maximal degree in co-relation 169059. Up to 6396 conditions per place. [2022-12-13 01:45:32,061 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 541 places, 2511 transitions, 118936 flow [2022-12-13 01:45:32,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 5354 [2022-12-13 01:45:32,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [643] L40-1-->L51-1: Formula: (and (< (+ 3 v_~i2~0_781) v_~n~0_479) (= 2 v_~j1~0_960) (= (+ v_~i2~0_781 4) v_~i2~0_779) (<= v_~m~0_539 3) (= v_~k1~0_938 (+ v_~k1~0_939 5)) (< v_~i1~0_787 v_~n~0_479) (< 2 v_~m~0_539) (= v_~i1~0_787 (+ v_~i1~0_788 1)) (= v_~k2~0_789 (+ v_~k2~0_791 (* v_~m~0_539 4)))) InVars {~m~0=v_~m~0_539, ~k2~0=v_~k2~0_791, ~k1~0=v_~k1~0_939, ~i2~0=v_~i2~0_781, ~i1~0=v_~i1~0_788, ~n~0=v_~n~0_479} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_445|, ~m~0=v_~m~0_539, ~k2~0=v_~k2~0_789, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_540|, ~k1~0=v_~k1~0_938, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_542|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_357|, ~i2~0=v_~i2~0_779, ~j1~0=v_~j1~0_960, ~i1~0=v_~i1~0_787, ~n~0=v_~n~0_479} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~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-13 01:45:32,532 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L41-6-->L41-6: Formula: (and (<= v_~m~0_551 (+ v_~j1~0_984 1)) (= v_~j1~0_982 0) (< v_~i1~0_813 v_~n~0_489) (= v_~i1~0_813 (+ v_~i1~0_814 1)) (= v_~k1~0_968 (+ v_~k1~0_969 1)) (< v_~j1~0_984 v_~m~0_551)) InVars {~m~0=v_~m~0_551, ~k1~0=v_~k1~0_969, ~j1~0=v_~j1~0_984, ~i1~0=v_~i1~0_814, ~n~0=v_~n~0_489} OutVars{~m~0=v_~m~0_551, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_558|, ~k1~0=v_~k1~0_968, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_560|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_371|, ~j1~0=v_~j1~0_982, ~i1~0=v_~i1~0_813, ~n~0=v_~n~0_489} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, 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-13 01:45:32,650 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [589] L40-1-->L51-1: Formula: (let ((.cse2 (< v_~j1~0_Out_128 (+ v_~m~0_In_65 1))) (.cse1 (= (+ 8 v_~k1~0_In_48) v_~k1~0_Out_96)) (.cse4 (= v_~j1~0_Out_128 8)) (.cse0 (= v_~k2~0_Out_114 (+ v_~k2~0_In_57 (* v_~m~0_In_65 2)))) (.cse3 (< v_~i1~0_In_41 v_~n~0_In_60)) (.cse6 (< (+ v_~i2~0_In_57 1) v_~n~0_In_60)) (.cse5 (= v_~i2~0_Out_114 (+ v_~i2~0_In_57 2)))) (or (and .cse0 .cse1 .cse2 .cse3 (< v_~i2~0_Out_114 (+ v_~n~0_In_60 1)) .cse4 .cse5) (and .cse0 (= v_~k1~0_Out_96 (+ 3 v_~k1~0_In_48)) .cse3 (< 2 v_~m~0_In_65) .cse6 (= 3 v_~j1~0_Out_128) .cse5) (and .cse0 .cse2 .cse3 .cse6 (= v_~k1~0_Out_96 (+ 7 v_~k1~0_In_48)) (= 7 v_~j1~0_Out_128) .cse5) (and .cse0 .cse1 (< 7 v_~m~0_In_65) .cse3 .cse6 .cse4 .cse5) (and (= (+ 9 v_~k1~0_In_48) v_~k1~0_Out_96) .cse0 (< 8 v_~m~0_In_65) .cse3 (= 9 v_~j1~0_Out_128) .cse6 .cse5))) InVars {~m~0=v_~m~0_In_65, ~k2~0=v_~k2~0_In_57, ~k1~0=v_~k1~0_In_48, ~i2~0=v_~i2~0_In_57, ~i1~0=v_~i1~0_In_41, ~n~0=v_~n~0_In_60} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_110|, ~m~0=v_~m~0_In_65, ~k2~0=v_~k2~0_Out_114, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_92|, ~k1~0=v_~k1~0_Out_96, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_92|, ~i2~0=v_~i2~0_Out_114, ~j1~0=v_~j1~0_Out_128, ~i1~0=v_~i1~0_In_41, ~n~0=v_~n~0_In_60} 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_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-13 01:45:33,670 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [589] L40-1-->L51-1: Formula: (let ((.cse2 (< v_~j1~0_Out_128 (+ v_~m~0_In_65 1))) (.cse1 (= (+ 8 v_~k1~0_In_48) v_~k1~0_Out_96)) (.cse4 (= v_~j1~0_Out_128 8)) (.cse0 (= v_~k2~0_Out_114 (+ v_~k2~0_In_57 (* v_~m~0_In_65 2)))) (.cse3 (< v_~i1~0_In_41 v_~n~0_In_60)) (.cse6 (< (+ v_~i2~0_In_57 1) v_~n~0_In_60)) (.cse5 (= v_~i2~0_Out_114 (+ v_~i2~0_In_57 2)))) (or (and .cse0 .cse1 .cse2 .cse3 (< v_~i2~0_Out_114 (+ v_~n~0_In_60 1)) .cse4 .cse5) (and .cse0 (= v_~k1~0_Out_96 (+ 3 v_~k1~0_In_48)) .cse3 (< 2 v_~m~0_In_65) .cse6 (= 3 v_~j1~0_Out_128) .cse5) (and .cse0 .cse2 .cse3 .cse6 (= v_~k1~0_Out_96 (+ 7 v_~k1~0_In_48)) (= 7 v_~j1~0_Out_128) .cse5) (and .cse0 .cse1 (< 7 v_~m~0_In_65) .cse3 .cse6 .cse4 .cse5) (and (= (+ 9 v_~k1~0_In_48) v_~k1~0_Out_96) .cse0 (< 8 v_~m~0_In_65) .cse3 (= 9 v_~j1~0_Out_128) .cse6 .cse5))) InVars {~m~0=v_~m~0_In_65, ~k2~0=v_~k2~0_In_57, ~k1~0=v_~k1~0_In_48, ~i2~0=v_~i2~0_In_57, ~i1~0=v_~i1~0_In_41, ~n~0=v_~n~0_In_60} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_110|, ~m~0=v_~m~0_In_65, ~k2~0=v_~k2~0_Out_114, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_92|, ~k1~0=v_~k1~0_Out_96, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_92|, ~i2~0=v_~i2~0_Out_114, ~j1~0=v_~j1~0_Out_128, ~i1~0=v_~i1~0_In_41, ~n~0=v_~n~0_In_60} 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-13 01:45:34,246 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-13 01:45:34,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} 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-13 01:45:34,447 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] L40-1-->L51-1: Formula: (and (= v_~j1~0_342 1) (< v_~i1~0_249 v_~n~0_173) (= v_~i2~0_227 (+ 2 v_~i2~0_229)) (< (+ v_~i2~0_229 1) v_~n~0_173) (= v_~k2~0_228 (+ (* 2 v_~m~0_211) v_~k2~0_230)) (<= v_~m~0_211 3) (= (+ v_~k1~0_325 4) v_~k1~0_324) (< 2 v_~m~0_211) (= v_~i1~0_249 (+ v_~i1~0_250 1))) InVars {~m~0=v_~m~0_211, ~k2~0=v_~k2~0_230, ~k1~0=v_~k1~0_325, ~i2~0=v_~i2~0_229, ~i1~0=v_~i1~0_250, ~n~0=v_~n~0_173} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_115|, ~m~0=v_~m~0_211, ~k2~0=v_~k2~0_228, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_176|, ~k1~0=v_~k1~0_324, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_178|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_101|, ~i2~0=v_~i2~0_227, ~j1~0=v_~j1~0_342, ~i1~0=v_~i1~0_249, ~n~0=v_~n~0_173} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~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-13 01:45:35,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] L40-1-->L51-1: Formula: (and (< (+ v_~i2~0_542 1) v_~n~0_363) (= v_~i2~0_540 (+ 2 v_~i2~0_542)) (= 3 v_~j1~0_696) (<= v_~m~0_409 9) (= (+ v_~i1~0_588 1) v_~i1~0_587) (= (+ (* 2 v_~m~0_409) v_~k2~0_545) v_~k2~0_543) (< 8 v_~m~0_409) (= v_~k1~0_680 (+ v_~k1~0_681 12)) (< v_~i1~0_587 v_~n~0_363)) InVars {~m~0=v_~m~0_409, ~k2~0=v_~k2~0_545, ~k1~0=v_~k1~0_681, ~i2~0=v_~i2~0_542, ~i1~0=v_~i1~0_588, ~n~0=v_~n~0_363} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_297|, ~m~0=v_~m~0_409, ~k2~0=v_~k2~0_543, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_386|, ~k1~0=v_~k1~0_680, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_388|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_258|, ~i2~0=v_~i2~0_540, ~j1~0=v_~j1~0_696, ~i1~0=v_~i1~0_587, ~n~0=v_~n~0_363} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~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-13 01:45:35,175 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 01:45:35,176 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9427 [2022-12-13 01:45:35,176 INFO L495 AbstractCegarLoop]: Abstraction has has 541 places, 2511 transitions, 119578 flow [2022-12-13 01:45:35,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:35,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:35,177 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:35,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-13 01:45:35,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:45:35,377 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:45:35,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash 880408034, now seen corresponding path program 1 times [2022-12-13 01:45:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:35,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990208594] [2022-12-13 01:45:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:45:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:35,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990208594] [2022-12-13 01:45:35,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990208594] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:45:35,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011616599] [2022-12-13 01:45:35,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:35,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:45:35,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:45:35,630 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:45:35,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 01:45:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:35,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 01:45:35,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:45:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:45:36,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:45:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:45:36,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011616599] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:45:36,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:45:36,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 14 [2022-12-13 01:45:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606280182] [2022-12-13 01:45:36,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:45:36,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 01:45:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:36,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 01:45:36,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-12-13 01:45:36,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 160 [2022-12-13 01:45:36,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 2511 transitions, 119578 flow. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:36,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:36,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 160 [2022-12-13 01:45:36,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:40,990 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 [] [2022-12-13 01:46:01,148 INFO L130 PetriNetUnfolder]: 12015/20136 cut-off events. [2022-12-13 01:46:01,149 INFO L131 PetriNetUnfolder]: For 1694888/1694888 co-relation queries the response was YES. [2022-12-13 01:46:01,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371984 conditions, 20136 events. 12015/20136 cut-off events. For 1694888/1694888 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 150689 event pairs, 406 based on Foata normal form. 3/20115 useless extension candidates. Maximal degree in co-relation 370383. Up to 19863 conditions per place. [2022-12-13 01:46:01,715 INFO L137 encePairwiseOnDemand]: 68/160 looper letters, 2417 selfloop transitions, 157 changer transitions 21/2595 dead transitions. [2022-12-13 01:46:01,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 2595 transitions, 127826 flow [2022-12-13 01:46:01,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 01:46:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 01:46:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2022-12-13 01:46:01,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11666666666666667 [2022-12-13 01:46:01,716 INFO L175 Difference]: Start difference. First operand has 541 places, 2511 transitions, 119578 flow. Second operand 12 states and 224 transitions. [2022-12-13 01:46:01,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 2595 transitions, 127826 flow [2022-12-13 01:46:35,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 2595 transitions, 121882 flow, removed 2848 selfloop flow, removed 8 redundant places. [2022-12-13 01:46:35,205 INFO L231 Difference]: Finished difference. Result has 551 places, 2538 transitions, 114963 flow [2022-12-13 01:46:35,207 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=113654, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=114963, PETRI_PLACES=551, PETRI_TRANSITIONS=2538} [2022-12-13 01:46:35,207 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 532 predicate places. [2022-12-13 01:46:35,207 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:35,207 INFO L89 Accepts]: Start accepts. Operand has 551 places, 2538 transitions, 114963 flow [2022-12-13 01:46:35,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:35,226 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:35,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 551 places, 2538 transitions, 114963 flow [2022-12-13 01:46:35,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 545 places, 2538 transitions, 114963 flow [2022-12-13 01:46:40,485 INFO L130 PetriNetUnfolder]: 3968/8116 cut-off events. [2022-12-13 01:46:40,485 INFO L131 PetriNetUnfolder]: For 839051/845490 co-relation queries the response was YES. [2022-12-13 01:46:40,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166817 conditions, 8116 events. 3968/8116 cut-off events. For 839051/845490 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 67081 event pairs, 193 based on Foata normal form. 8/8112 useless extension candidates. Maximal degree in co-relation 166597. Up to 5878 conditions per place. [2022-12-13 01:46:40,734 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 545 places, 2538 transitions, 114963 flow [2022-12-13 01:46:40,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 5406 [2022-12-13 01:46:40,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [447] L40-1-->L51-1: Formula: (and (< v_~i2~0_200 (+ v_~n~0_153 1)) (= (+ (* 2 v_~m~0_165) v_~k2~0_203) v_~k2~0_201) (= v_~j1~0_220 0) (= v_~k1~0_202 (+ v_~k1~0_203 3)) (= (+ v_~i1~0_212 1) v_~i1~0_211) (<= v_~m~0_165 3) (< 2 v_~m~0_165) (= v_~i2~0_200 (+ 2 v_~i2~0_202)) (< v_~i1~0_211 v_~n~0_153)) InVars {~m~0=v_~m~0_165, ~k2~0=v_~k2~0_203, ~k1~0=v_~k1~0_203, ~i2~0=v_~i2~0_202, ~i1~0=v_~i1~0_212, ~n~0=v_~n~0_153} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_98|, ~m~0=v_~m~0_165, ~k2~0=v_~k2~0_201, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_95|, ~k1~0=v_~k1~0_202, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_97|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_81|, ~i2~0=v_~i2~0_200, ~j1~0=v_~j1~0_220, ~i1~0=v_~i1~0_211, ~n~0=v_~n~0_153} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~j1~0, ~i1~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-13 01:46:40,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L40-1-->L40-1: Formula: (and (not (< v_~j1~0_108 v_~m~0_93)) (= v_~k1~0_101 (+ v_~k1~0_102 2)) (= 2 v_~j1~0_108) (= v_~i1~0_110 (+ v_~i1~0_111 1)) (< 1 v_~m~0_93) (< v_~i1~0_111 v_~n~0_83)) InVars {~m~0=v_~m~0_93, ~k1~0=v_~k1~0_102, ~i1~0=v_~i1~0_111, ~n~0=v_~n~0_83} OutVars{~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_33|, ~k1~0=v_~k1~0_101, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_35|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_43|, ~j1~0=v_~j1~0_108, ~i1~0=v_~i1~0_110, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, 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-13 01:46:41,092 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:46:41,092 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5885 [2022-12-13 01:46:41,092 INFO L495 AbstractCegarLoop]: Abstraction has has 545 places, 2538 transitions, 115063 flow [2022-12-13 01:46:41,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:41,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:41,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:41,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-13 01:46:41,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-13 01:46:41,293 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:46:41,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1301755085, now seen corresponding path program 1 times [2022-12-13 01:46:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:41,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732355594] [2022-12-13 01:46:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:46:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:41,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732355594] [2022-12-13 01:46:41,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732355594] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:46:41,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163521016] [2022-12-13 01:46:41,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:41,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:46:41,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:46:41,430 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:46:41,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-13 01:46:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:41,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:46:41,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:46:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 01:46:41,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:46:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 01:46:41,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163521016] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:46:41,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:46:41,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-12-13 01:46:41,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895392822] [2022-12-13 01:46:41,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:46:41,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 01:46:41,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:41,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 01:46:41,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-13 01:46:41,766 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 159 [2022-12-13 01:46:41,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 2538 transitions, 115063 flow. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:41,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:41,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 159 [2022-12-13 01:46:41,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:04,927 INFO L130 PetriNetUnfolder]: 12898/21581 cut-off events. [2022-12-13 01:47:04,927 INFO L131 PetriNetUnfolder]: For 1796180/1796180 co-relation queries the response was YES. [2022-12-13 01:47:05,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388137 conditions, 21581 events. 12898/21581 cut-off events. For 1796180/1796180 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 162883 event pairs, 422 based on Foata normal form. 14/21567 useless extension candidates. Maximal degree in co-relation 386789. Up to 12951 conditions per place. [2022-12-13 01:47:05,325 INFO L137 encePairwiseOnDemand]: 34/159 looper letters, 1723 selfloop transitions, 1382 changer transitions 4/3109 dead transitions. [2022-12-13 01:47:05,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 3109 transitions, 141362 flow [2022-12-13 01:47:05,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 01:47:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-13 01:47:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 323 transitions. [2022-12-13 01:47:05,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.06348270440251573 [2022-12-13 01:47:05,327 INFO L175 Difference]: Start difference. First operand has 545 places, 2538 transitions, 115063 flow. Second operand 32 states and 323 transitions. [2022-12-13 01:47:05,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 3109 transitions, 141362 flow [2022-12-13 01:47:39,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 3109 transitions, 140506 flow, removed 382 selfloop flow, removed 3 redundant places. [2022-12-13 01:47:39,492 INFO L231 Difference]: Finished difference. Result has 590 places, 2715 transitions, 128020 flow [2022-12-13 01:47:39,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=114381, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=128020, PETRI_PLACES=590, PETRI_TRANSITIONS=2715} [2022-12-13 01:47:39,494 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 571 predicate places. [2022-12-13 01:47:39,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:39,495 INFO L89 Accepts]: Start accepts. Operand has 590 places, 2715 transitions, 128020 flow [2022-12-13 01:47:39,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:39,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:39,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 590 places, 2715 transitions, 128020 flow [2022-12-13 01:47:39,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 589 places, 2715 transitions, 128020 flow [2022-12-13 01:47:46,421 INFO L130 PetriNetUnfolder]: 4263/8688 cut-off events. [2022-12-13 01:47:46,422 INFO L131 PetriNetUnfolder]: For 1000188/1007573 co-relation queries the response was YES. [2022-12-13 01:47:46,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184443 conditions, 8688 events. 4263/8688 cut-off events. For 1000188/1007573 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 72497 event pairs, 223 based on Foata normal form. 5/8682 useless extension candidates. Maximal degree in co-relation 183681. Up to 6383 conditions per place. [2022-12-13 01:47:46,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 589 places, 2715 transitions, 128020 flow [2022-12-13 01:47:46,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 5768 [2022-12-13 01:47:46,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [598] L40-1-->L41-6: Formula: (and (= (+ (* 2 v_~m~0_453) v_~k2~0_615) v_~k2~0_614) (< 2 v_~m~0_453) (= (+ 2 v_~i2~0_612) v_~i2~0_611) (= v_~j1~0_781 0) (<= v_~m~0_453 3) (< (+ v_~i2~0_612 1) v_~n~0_405) (= (+ v_~i1~0_656 1) v_~i1~0_655) (< v_~i1~0_655 v_~n~0_405) (= v_~k1~0_751 (+ v_~k1~0_752 3))) InVars {~m~0=v_~m~0_453, ~k2~0=v_~k2~0_615, ~k1~0=v_~k1~0_752, ~i2~0=v_~i2~0_612, ~i1~0=v_~i1~0_656, ~n~0=v_~n~0_405} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_338|, ~m~0=v_~m~0_453, ~k2~0=v_~k2~0_614, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_427|, ~k1~0=v_~k1~0_751, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_429|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_288|, ~j1~0=v_~j1~0_781, ~i2~0=v_~i2~0_611, ~i1~0=v_~i1~0_655, ~n~0=v_~n~0_405} 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-13 01:47:47,146 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L40-1-->L41-6: Formula: (and (= v_~k1~0_440 (+ v_~k1~0_442 10)) (< v_~i1~0_382 v_~n~0_253) (= (+ v_~k2~0_330 v_~m~0_295) v_~k2~0_329) (< v_~j1~0_489 (+ v_~m~0_295 1)) (= v_~j1~0_489 10) (< v_~i2~0_330 v_~n~0_253) (= v_~i2~0_329 (+ v_~i2~0_330 1))) InVars {~m~0=v_~m~0_295, ~k1~0=v_~k1~0_442, ~k2~0=v_~k2~0_330, ~i2~0=v_~i2~0_330, ~i1~0=v_~i1~0_382, ~n~0=v_~n~0_253} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_173|, ~m~0=v_~m~0_295, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_243|, ~k1~0=v_~k1~0_440, ~k2~0=v_~k2~0_329, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_245|, ~j1~0=v_~j1~0_489, ~i2~0=v_~i2~0_329, ~i1~0=v_~i1~0_382, ~n~0=v_~n~0_253} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, ~k1~0, ~k2~0, thread1Thread1of1ForFork0_#t~post2, ~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-13 01:47:47,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L40-1-->L51-1: Formula: (let ((.cse0 (< v_~i1~0_In_51 v_~n~0_In_75)) (.cse1 (= v_~i2~0_Out_144 (+ v_~i2~0_In_72 2))) (.cse2 (< (+ v_~i2~0_In_72 1) v_~n~0_In_75)) (.cse3 (= (+ v_~k2~0_In_72 (* v_~m~0_In_80 2)) v_~k2~0_Out_144))) (or (and (< v_~j1~0_Out_158 (+ v_~m~0_In_80 1)) .cse0 (= v_~j1~0_Out_158 11) .cse1 (= (+ v_~k1~0_In_59 11) v_~k1~0_Out_118) .cse2 .cse3) (and (= (+ 12 v_~k1~0_In_59) v_~k1~0_Out_118) .cse0 (= v_~j1~0_Out_158 12) .cse1 (< 11 v_~m~0_In_80) .cse2 .cse3) (and (< 12 v_~m~0_In_80) .cse0 .cse1 (= v_~j1~0_Out_158 13) .cse2 .cse3 (= v_~k1~0_Out_118 (+ v_~k1~0_In_59 13))))) InVars {~m~0=v_~m~0_In_80, ~k2~0=v_~k2~0_In_72, ~k1~0=v_~k1~0_In_59, ~i2~0=v_~i2~0_In_72, ~i1~0=v_~i1~0_In_51, ~n~0=v_~n~0_In_75} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_140|, ~m~0=v_~m~0_In_80, ~k2~0=v_~k2~0_Out_144, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_114|, ~k1~0=v_~k1~0_Out_118, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_114|, ~i2~0=v_~i2~0_Out_144, ~j1~0=v_~j1~0_Out_158, ~i1~0=v_~i1~0_In_51, ~n~0=v_~n~0_In_75} 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_1 1) v_~i1~0_Out_2) (not (< v_~j1~0_In_1 v_~m~0_In_1))) InVars {~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_In_1} OutVars{~j1~0=v_~j1~0_In_1, ~m~0=v_~m~0_In_1, ~i1~0=v_~i1~0_Out_2, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-13 01:47:47,687 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-13 01:47:47,779 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 01:47:47,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8286 [2022-12-13 01:47:47,780 INFO L495 AbstractCegarLoop]: Abstraction has has 587 places, 2713 transitions, 128219 flow [2022-12-13 01:47:47,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:47,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:47,780 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:47:47,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-13 01:47:47,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:47:47,985 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:47:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1196260852, now seen corresponding path program 1 times [2022-12-13 01:47:47,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:47,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733867255] [2022-12-13 01:47:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:47,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:47:48,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:48,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733867255] [2022-12-13 01:47:48,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733867255] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:47:48,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489511220] [2022-12-13 01:47:48,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:48,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:47:48,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:47:48,064 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:47:48,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-13 01:47:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:48,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:47:48,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:47:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:47:48,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:47:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:47:48,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489511220] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:47:48,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:47:48,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 01:47:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747763080] [2022-12-13 01:47:48,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:47:48,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:47:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:48,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:47:48,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:47:48,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 167 [2022-12-13 01:47:48,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 2713 transitions, 128219 flow. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:48,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:48,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 167 [2022-12-13 01:47:48,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:13,394 INFO L130 PetriNetUnfolder]: 13379/22426 cut-off events. [2022-12-13 01:48:13,394 INFO L131 PetriNetUnfolder]: For 2111713/2111713 co-relation queries the response was YES. [2022-12-13 01:48:13,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415818 conditions, 22426 events. 13379/22426 cut-off events. For 2111713/2111713 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 170583 event pairs, 2306 based on Foata normal form. 128/22528 useless extension candidates. Maximal degree in co-relation 414432. Up to 13541 conditions per place. [2022-12-13 01:48:13,817 INFO L137 encePairwiseOnDemand]: 71/167 looper letters, 2467 selfloop transitions, 787 changer transitions 1/3255 dead transitions. [2022-12-13 01:48:13,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 3255 transitions, 159035 flow [2022-12-13 01:48:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 01:48:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 01:48:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 229 transitions. [2022-12-13 01:48:13,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10548134500230309 [2022-12-13 01:48:13,818 INFO L175 Difference]: Start difference. First operand has 587 places, 2713 transitions, 128219 flow. Second operand 13 states and 229 transitions. [2022-12-13 01:48:13,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 3255 transitions, 159035 flow [2022-12-13 01:48:54,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 3255 transitions, 157900 flow, removed 516 selfloop flow, removed 3 redundant places. [2022-12-13 01:48:55,014 INFO L231 Difference]: Finished difference. Result has 603 places, 2765 transitions, 132684 flow [2022-12-13 01:48:55,016 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=127104, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=735, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1929, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=132684, PETRI_PLACES=603, PETRI_TRANSITIONS=2765} [2022-12-13 01:48:55,017 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 584 predicate places. [2022-12-13 01:48:55,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:55,017 INFO L89 Accepts]: Start accepts. Operand has 603 places, 2765 transitions, 132684 flow [2022-12-13 01:48:55,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:55,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:55,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 603 places, 2765 transitions, 132684 flow [2022-12-13 01:48:55,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 602 places, 2765 transitions, 132684 flow Received shutdown request... [2022-12-13 01:49:00,858 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 01:49:00,858 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 01:49:00,926 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 01:49:00,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-13 01:49:01,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-13 01:49:01,127 WARN L619 AbstractCegarLoop]: Verification canceled: while PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 603 places, 2765 transitions, 132684 flow,while LiptonReduction was applying LiptonReduction to Petri net that has 602 places, 2765 transitions, 132684 flow,while PetriNetUnfolder was constructing finite prefix that currently has 148849 conditions, 6748 events (3278/6747 cut-off events. For 826990/835230 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 60129 event pairs, 152 based on Foata normal form. 5/7008 useless extension candidates. Maximal degree in co-relation 148506. Up to 4914 conditions per place.). [2022-12-13 01:49:01,129 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 01:49:01,129 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 01:49:01,130 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:49:01,133 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:49:01,133 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:49:01,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:49:01 BasicIcfg [2022-12-13 01:49:01,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:49:01,135 INFO L158 Benchmark]: Toolchain (without parser) took 805494.54ms. Allocated memory was 204.5MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 180.3MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 5.3GB. Max. memory is 8.0GB. [2022-12-13 01:49:01,136 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 204.5MB. Free memory is still 181.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:49:01,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.78ms. Allocated memory is still 204.5MB. Free memory was 180.3MB in the beginning and 169.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-13 01:49:01,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.97ms. Allocated memory is still 204.5MB. Free memory was 169.2MB in the beginning and 167.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:49:01,140 INFO L158 Benchmark]: Boogie Preprocessor took 26.33ms. Allocated memory is still 204.5MB. Free memory was 167.7MB in the beginning and 166.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 01:49:01,141 INFO L158 Benchmark]: RCFGBuilder took 443.30ms. Allocated memory is still 204.5MB. Free memory was 166.1MB in the beginning and 152.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 01:49:01,141 INFO L158 Benchmark]: TraceAbstraction took 804780.05ms. Allocated memory was 204.5MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 151.4MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 5.3GB. Max. memory is 8.0GB. [2022-12-13 01:49:01,145 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.15ms. Allocated memory is still 204.5MB. Free memory is still 181.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.78ms. Allocated memory is still 204.5MB. Free memory was 180.3MB in the beginning and 169.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.97ms. Allocated memory is still 204.5MB. Free memory was 169.2MB in the beginning and 167.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.33ms. Allocated memory is still 204.5MB. Free memory was 167.7MB in the beginning and 166.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 443.30ms. Allocated memory is still 204.5MB. Free memory was 166.1MB in the beginning and 152.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 804780.05ms. Allocated memory was 204.5MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 151.4MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 5.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 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.8s, 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): 25, Positive cache size: 25, Positive conditional cache size: 17, 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): 25, Positive cache size: 25, Positive conditional cache size: 17, 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: 1.0s, 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): 54, Positive cache size: 54, Positive conditional cache size: 39, 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, 125 PlacesBefore, 125 PlacesAfterwards, 616 TransitionsBefore, 616 TransitionsAfterwards, 1396 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): 62, Positive cache size: 62, Positive conditional cache size: 47, 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.4s, 154 PlacesBefore, 153 PlacesAfterwards, 705 TransitionsBefore, 704 TransitionsAfterwards, 1614 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 9, 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: 18, independent: 18, independent conditional: 9, 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: 18, independent: 15, independent conditional: 6, 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): 68, Positive cache size: 68, Positive conditional cache size: 50, 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: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 141 PlacesBefore, 141 PlacesAfterwards, 636 TransitionsBefore, 636 TransitionsAfterwards, 1452 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 5, independent conditional: 5, 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): 73, Positive cache size: 73, Positive conditional cache size: 55, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 146 PlacesBefore, 146 PlacesAfterwards, 661 TransitionsBefore, 661 TransitionsAfterwards, 1538 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 21, 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: 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] , 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: 21, independent: 15, independent conditional: 15, 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): 143, Positive cache size: 143, Positive conditional cache size: 118, Positive unconditional cache size: 25, 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.7s, 165 PlacesBefore, 165 PlacesAfterwards, 710 TransitionsBefore, 710 TransitionsAfterwards, 1662 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 21, independent conditional: 21, 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): 235, Positive cache size: 235, Positive conditional cache size: 202, Positive unconditional cache size: 33, 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.6s, 180 PlacesBefore, 179 PlacesAfterwards, 826 TransitionsBefore, 825 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 5, 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: 14, independent: 14, independent conditional: 5, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 14, independent: 13, independent conditional: 4, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 239, Positive conditional cache size: 203, Positive unconditional cache size: 36, 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.1s, 173 PlacesBefore, 173 PlacesAfterwards, 986 TransitionsBefore, 986 TransitionsAfterwards, 2222 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 240, Positive conditional cache size: 203, Positive unconditional cache size: 37, 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, 181 PlacesBefore, 181 PlacesAfterwards, 1107 TransitionsBefore, 1107 TransitionsAfterwards, 2460 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): 240, Positive cache size: 240, Positive conditional cache size: 203, Positive unconditional cache size: 37, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 216 PlacesBefore, 214 PlacesAfterwards, 1314 TransitionsBefore, 1311 TransitionsAfterwards, 2946 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 33, independent unconditional: 8, 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: 41, independent: 41, independent conditional: 33, independent unconditional: 8, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 41, independent: 28, independent conditional: 20, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 261, Positive conditional cache size: 220, Positive unconditional cache size: 41, 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: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 225 PlacesBefore, 224 PlacesAfterwards, 1378 TransitionsBefore, 1376 TransitionsAfterwards, 3074 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 35, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 295, Positive conditional cache size: 249, Positive unconditional cache size: 46, 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: 1.0s, 221 PlacesBefore, 219 PlacesAfterwards, 1354 TransitionsBefore, 1351 TransitionsAfterwards, 3024 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 19, 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: 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: 19, independent: 11, independent conditional: 11, independent unconditional: 0, 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): 329, Positive cache size: 329, Positive conditional cache size: 278, Positive unconditional cache size: 51, 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: 1.2s, 246 PlacesBefore, 245 PlacesAfterwards, 1601 TransitionsBefore, 1600 TransitionsAfterwards, 3544 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 31, 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: 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 340, Positive conditional cache size: 289, Positive unconditional cache size: 51, 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.9s, 256 PlacesBefore, 256 PlacesAfterwards, 1710 TransitionsBefore, 1709 TransitionsAfterwards, 3778 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 8, 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: 10, independent: 10, independent conditional: 8, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 343, Positive conditional cache size: 291, Positive unconditional cache size: 52, 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: 1.2s, 283 PlacesBefore, 280 PlacesAfterwards, 1952 TransitionsBefore, 1948 TransitionsAfterwards, 4304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 10 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: 34, 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: 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 387, Positive conditional cache size: 331, Positive unconditional cache size: 56, 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, 276 PlacesBefore, 276 PlacesAfterwards, 1699 TransitionsBefore, 1699 TransitionsAfterwards, 3728 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): 387, Positive cache size: 387, Positive conditional cache size: 331, Positive unconditional cache size: 56, 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, 266 PlacesBefore, 266 PlacesAfterwards, 943 TransitionsBefore, 943 TransitionsAfterwards, 2152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 392, Positive conditional cache size: 335, Positive unconditional cache size: 57, 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, 273 PlacesBefore, 273 PlacesAfterwards, 1062 TransitionsBefore, 1062 TransitionsAfterwards, 2430 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 394, Positive conditional cache size: 336, Positive unconditional cache size: 58, 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, 278 PlacesBefore, 278 PlacesAfterwards, 1073 TransitionsBefore, 1073 TransitionsAfterwards, 2452 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): 394, Positive cache size: 394, Positive conditional cache size: 336, Positive unconditional cache size: 58, 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.8s, 304 PlacesBefore, 302 PlacesAfterwards, 1170 TransitionsBefore, 1168 TransitionsAfterwards, 2656 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 24, 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: 26, independent: 26, independent conditional: 24, 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: 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: 26, independent: 18, independent conditional: 16, independent unconditional: 2, 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): 433, Positive cache size: 433, Positive conditional cache size: 372, Positive unconditional cache size: 61, 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.5s, 307 PlacesBefore, 306 PlacesAfterwards, 1178 TransitionsBefore, 1174 TransitionsAfterwards, 2666 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 471, Positive cache size: 471, Positive conditional cache size: 409, Positive unconditional cache size: 62, 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.4s, 312 PlacesBefore, 312 PlacesAfterwards, 1175 TransitionsBefore, 1175 TransitionsAfterwards, 2660 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 5, independent: 2, independent conditional: 2, 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): 504, Positive cache size: 504, Positive conditional cache size: 441, Positive unconditional cache size: 63, 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, 314 PlacesBefore, 314 PlacesAfterwards, 1210 TransitionsBefore, 1210 TransitionsAfterwards, 2736 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): 504, Positive cache size: 504, Positive conditional cache size: 441, Positive unconditional cache size: 63, 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.4s, 351 PlacesBefore, 348 PlacesAfterwards, 1441 TransitionsBefore, 1438 TransitionsAfterwards, 3158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 26, independent conditional: 26, 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): 585, Positive cache size: 585, Positive conditional cache size: 515, Positive unconditional cache size: 70, 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, 357 PlacesBefore, 357 PlacesAfterwards, 1462 TransitionsBefore, 1462 TransitionsAfterwards, 3192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 3, independent: 0, independent conditional: 0, 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): 588, Positive cache size: 588, Positive conditional cache size: 518, Positive unconditional cache size: 70, 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.2s, 367 PlacesBefore, 367 PlacesAfterwards, 1472 TransitionsBefore, 1472 TransitionsAfterwards, 3212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 607, Positive cache size: 607, Positive conditional cache size: 536, Positive unconditional cache size: 71, 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.4s, 386 PlacesBefore, 386 PlacesAfterwards, 1509 TransitionsBefore, 1509 TransitionsAfterwards, 3292 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 609, Positive cache size: 609, Positive conditional cache size: 538, Positive unconditional cache size: 71, 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, 396 PlacesBefore, 396 PlacesAfterwards, 1597 TransitionsBefore, 1597 TransitionsAfterwards, 3468 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): 609, Positive cache size: 609, Positive conditional cache size: 538, Positive unconditional cache size: 71, 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.7s, 396 PlacesBefore, 396 PlacesAfterwards, 1533 TransitionsBefore, 1539 TransitionsAfterwards, 3340 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 56, 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: 56, independent: 56, independent conditional: 56, 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: 56, independent: 56, independent conditional: 30, independent unconditional: 26, 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: 56, independent: 56, independent conditional: 30, independent unconditional: 26, 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: 12, independent: 12, independent conditional: 11, independent unconditional: 1, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 56, independent: 44, independent conditional: 19, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 11, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 634, Positive cache size: 634, Positive conditional cache size: 549, Positive unconditional cache size: 85, 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: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 417 PlacesBefore, 417 PlacesAfterwards, 1686 TransitionsBefore, 1686 TransitionsAfterwards, 3646 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): 634, Positive cache size: 634, Positive conditional cache size: 549, Positive unconditional cache size: 85, 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, 417 PlacesBefore, 417 PlacesAfterwards, 1698 TransitionsBefore, 1698 TransitionsAfterwards, 3670 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): 634, Positive cache size: 634, Positive conditional cache size: 549, Positive unconditional cache size: 85, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 438 PlacesBefore, 438 PlacesAfterwards, 1749 TransitionsBefore, 1749 TransitionsAfterwards, 3778 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 635, Positive cache size: 635, Positive conditional cache size: 550, Positive unconditional cache size: 85, 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, 468 PlacesBefore, 468 PlacesAfterwards, 2106 TransitionsBefore, 2106 TransitionsAfterwards, 4492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 643, Positive cache size: 643, Positive conditional cache size: 558, Positive unconditional cache size: 85, 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, 472 PlacesBefore, 472 PlacesAfterwards, 2102 TransitionsBefore, 2102 TransitionsAfterwards, 4484 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): 643, Positive cache size: 643, Positive conditional cache size: 558, Positive unconditional cache size: 85, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 541 PlacesBefore, 541 PlacesAfterwards, 2511 TransitionsBefore, 2511 TransitionsAfterwards, 5354 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 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): 659, Positive cache size: 659, Positive conditional cache size: 572, Positive unconditional cache size: 87, 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.4s, 545 PlacesBefore, 545 PlacesAfterwards, 2538 TransitionsBefore, 2538 TransitionsAfterwards, 5406 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 6, independent: 1, independent conditional: 1, 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): 698, Positive cache size: 698, Positive conditional cache size: 610, Positive unconditional cache size: 88, 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: 1.0s, 589 PlacesBefore, 587 PlacesAfterwards, 2715 TransitionsBefore, 2713 TransitionsAfterwards, 5768 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 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: 12, independent: 6, independent conditional: 6, 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): 743, Positive cache size: 743, Positive conditional cache size: 653, Positive unconditional cache size: 90, 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 - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 603 places, 2765 transitions, 132684 flow,while LiptonReduction was applying LiptonReduction to Petri net that has 602 places, 2765 transitions, 132684 flow,while PetriNetUnfolder was constructing finite prefix that currently has 148849 conditions, 6748 events (3278/6747 cut-off events. For 826990/835230 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 60129 event pairs, 152 based on Foata normal form. 5/7008 useless extension candidates. Maximal degree in co-relation 148506. Up to 4914 conditions per place.). - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 603 places, 2765 transitions, 132684 flow,while LiptonReduction was applying LiptonReduction to Petri net that has 602 places, 2765 transitions, 132684 flow,while PetriNetUnfolder was constructing finite prefix that currently has 148849 conditions, 6748 events (3278/6747 cut-off events. For 826990/835230 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 60129 event pairs, 152 based on Foata normal form. 5/7008 useless extension candidates. Maximal degree in co-relation 148506. Up to 4914 conditions per place.). - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 603 places, 2765 transitions, 132684 flow,while LiptonReduction was applying LiptonReduction to Petri net that has 602 places, 2765 transitions, 132684 flow,while PetriNetUnfolder was constructing finite prefix that currently has 148849 conditions, 6748 events (3278/6747 cut-off events. For 826990/835230 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 60129 event pairs, 152 based on Foata normal form. 5/7008 useless extension candidates. Maximal degree in co-relation 148506. Up to 4914 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 129 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 804.6s, OverallIterations: 46, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 662.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 3114 SdHoareTripleChecker+Valid, 104.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3114 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 99.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4569 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33964 IncrementalHoareTripleChecker+Invalid, 38555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4569 mSolverCounterUnsat, 0 mSDtfsCounter, 33964 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1480 GetRequests, 729 SyntacticMatches, 84 SemanticMatches, 667 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4131 ImplicationChecksByTransitivity, 45.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132684occurred in iteration=46, InterpolantAutomatonStates: 616, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 30.2s InterpolantComputationTime, 1194 NumberOfCodeBlocks, 1194 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 1586 ConstructedInterpolants, 98 QuantifiedInterpolants, 29780 SizeOfPredicates, 173 NumberOfNonLiveVariables, 4641 ConjunctsInSsa, 464 ConjunctsInUnsatCore, 115 InterpolantComputations, 13 PerfectInterpolantSequences, 125/426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown